Skip to main content
Article thumbnail
Location of Repository

Homomorphisms of tringle-free graphs without a K5-minor

By Reza Naserasr, Yared Nigussie and Riste Skrekovski


In the course of extending Grötzsch’s theorem, we prove that every triangle-free graph without a K5-minor is 3-colorable. It has been recently proved that every triangle-free planar graph admits a homomorphism to the Clebsch graph. We also extend this result to the class of triangle-free graphs without a K5-minor. This is related to some conjectures which generalize the Four-Color Theorem. While we show that our results cannot be extended directly, we conjecture that every K6minor-free graph of girth at least 5 is 3-colorable

Year: 2005
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.