K₅-free bound for the class of planar graphs

DOI10.1016/J.EJC.2006.06.009zbMATH Open1111.05039OpenAlexW4206382042MaRDI QIDQ852707FDOQ852707

Authors: 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

Recommendations

• Dynamic coloring of graphs having no \(K_5\) minor
• The edge colorings of \(K_5\)-minor free graphs
• \(k\)-fold \( (2k+2)\)-coloring of planar graphs
• Plane graphs with maximum degree 5 are 11-linear-colorable
• A sufficient condition for a planar graph of maximum degree five to be class 1

zbMATH Keywords

graph homomorphismvertex colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Folding
• Title not available (Why is that?)
• Homomorphisms and edge-colourings of planar graphs
• Universal \(H\)-colorable graphs without a given configuration
• Homomorphism bounded classes of graphs

Cited In (2)

• Planar graphs are \(9/2\)-colorable
• Bounding the number of embeddings of 5-connected projective-planar graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q852707)