Linear coloring of planar graphs with girth at least five

zbMATH Open1240.05109MaRDI QIDQ3109526FDOQ3109526

Authors: Kan Wang, Weifan Wang 

Publication date: 27 January 2012

Recommendations

• Linear coloring of planar graphs with large girth
• New upper bounds on linear coloring of planar graphs
• scientific article; zbMATH DE number 5952407
• On linear coloring of planar graphs with small girth
• Linear coloring of sparse graphs

zbMATH Keywords

girthmaximum degreeplanar graphlinear coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cited In (8)

• On linear coloring of planar graphs with small girth
• Plane graphs with maximum degree 5 are 11-linear-colorable
• Title not available (Why is that?)
• A Lebesgue's type theorem on toroidal graphs and its application to linear coloring
• Linear coloring of graphs embeddable in a surface of nonnegative characteristic
• Linear coloring of planar graphs with large girth
• New upper bounds on linear coloring of planar graphs
• Oriented 5-coloring of sparse plane graphs

This page was built for publication: Linear coloring of planar graphs with girth at least five

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