Homomorphisms from sparse graphs to the Petersen graph

DOI10.1016/J.DISC.2010.04.002zbMath1208.05087OpenAlexW2002373719MaRDI QIDQ709319

Min Chen, Andre Raspaud

Publication date: 18 October 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.04.002

zbMATH Keywords

fractional chromatic numberhomomorphismcoloringmaximum average degree

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Towards the Chen-Raspaud conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(n\)-tuple coloring of planar graphs with large odd girth
• Homomorphisms from sparse graphs with large girth.
• Circular \((5,2)\)-coloring of sparse graphs
• Planar Graphs of Odd-Girth at Least 9 are Homomorphic to the Petersen Graph
• Girth and fractional chromatic number of planar graphs
• Star chromatic number
• On the Imbedding of Linear Graphs in Surfaces
• A Contribution to the Theory of Chromatic Polynomials
• Circular chromatic number of planar graphs of large odd girth

This page was built for publication: Homomorphisms from sparse graphs to the Petersen graph