New upper bounds on linear coloring of planar graphs

DOI10.1007/s10114-011-0317-zzbMath1252.05067OpenAlexW1992803748MaRDI QIDQ1757984

Bin Liu, Gui Zhen Liu

Publication date: 7 November 2012

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-011-0317-z

zbMATH Keywords

girthplanar graphlinear coloring

Mathematics Subject Classification ID

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

Related Items (1)

The linear \(t\)-colorings of Sierpiński-like graphs

Cites Work

• Linear choosability of graphs
• Linear coloring of graphs embeddable in a surface of nonnegative characteristic
• Linear coloring of planar graphs with large girth
• Colouring a graph frugally
• Linear coloring of graphs
• Coloring the square of a planar graph
• Acyclic colorings of planar graphs

This page was built for publication: New upper bounds on linear coloring of planar graphs