A result on linear coloring of planar graphs

DOI10.1016/J.IPL.2012.07.016zbMath1248.05060OpenAlexW2170388373MaRDI QIDQ456164

Chunli Cai, Wenjuan Yang, Dezheng Xie

Publication date: 23 October 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.07.016

zbMATH Keywords

combinatorial problemsplanar graphlinear coloringlinear chromatic number

Mathematics Subject Classification ID

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

Related Items (1)

Equitable partition of planar graphs

Cites Work

• 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

This page was built for publication: A result on linear coloring of planar graphs