Plane graphs with maximum degree 5 are 11-linear-colorable

DOI10.3770/J.ISSN:2095-2651.2012.06.002MaRDI QIDQ4926543zbMATH OpenFDO

Authors Kan Wang, Weifan Wang

Publication date 20 June 2013

Full work available at URL https://doi.org/10.3770/J.ISSN:2095-2651.2012.06.002

zbMATH Keywords

linear coloringmaximum degreeplanar graph

Mathematics Subject Classification ID

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

Recommendations

• Plane graphs with maximum degree 6 are 13-linear-colorable
• An upper bound of linear chromatic number of planar graphs
• A result on linear coloring of planar graphs
• 19-linear-colorable graphs with maximum degree 6
• Linear coloring of planar graphs with girth at least five

Cited in

(5)

• Plane graphs with maximum degree 9 are entirely 11-choosable
• Linear coloring of planar graphs without 4-cycles
• A result on linear coloring of planar graphs
• Plane graphs with maximum degree 6 are 13-linear-colorable
• \(K_{5}\)-free bound for the class of planar graphs

This page was built for publication: Plane graphs with maximum degree 5 are 11-linear-colorable

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