\(K_{5}\)-free bound for the class of planar graphs

DOI10.1016/J.EJC.2006.06.009zbMath1111.05039OpenAlexW4206382042MaRDI QIDQ852707

Reza Naserasr

Publication date: 15 November 2006

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2006.06.009

zbMATH Keywords

graph homomorphismvertex colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Planar graphs are \(9/2\)-colorable

Cites Work

• Homomorphisms and edge-colourings of planar graphs
• Universal \(H\)-colorable graphs without a given configuration
• Homomorphism bounded classes of graphs
• Folding
• Unnamed Item

This page was built for publication: \(K_{5}\)-free bound for the class of planar graphs