On linear coloring of planar graphs with small girth

DOI10.1016/J.DAM.2014.03.019zbMath1297.05082OpenAlexW2084667381MaRDI QIDQ400495

Wensong Lin, Wei Dong

Publication date: 22 August 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.03.019

zbMATH Keywords

cyclegirthplanar graphlinear coloring

Mathematics Subject Classification ID

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

Related Items (1)

Linear list coloring of some sparse graphs

Cites Work

• Linear coloring of sparse graphs
• Improved bounds on linear coloring of plane graphs
• Upper bounds on the linear chromatic number of a graph
• 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
• Linear choosability of sparse graphs
• Acyclic colorings of planar graphs
• Unnamed Item

This page was built for publication: On linear coloring of planar graphs with small girth