Upper bounds on the linear chromatic number of a graph

DOI10.1016/J.DISC.2010.10.023zbMath1210.05045OpenAlexW2041763089MaRDI QIDQ626759

Chao Li, Andre Raspaud, Wei Fan Wang

Publication date: 18 February 2011

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

Full work available at URL: https://doi.org/10.1016/j.disc.2010.10.023

zbMATH Keywords

planar graphmaximum degreelinear coloring

Mathematics Subject Classification ID

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

Related Items (5)

Linear coloring of planar graphs without 4-cycles ⋮ On linear coloring of planar graphs with small girth ⋮ Linear list coloring of some sparse graphs ⋮ A result on linear coloring of planar graphs ⋮ Linear colorings of subcubic graphs

Cites Work

• Linear choosability of graphs
• Linear coloring of graphs embeddable in a surface of nonnegative characteristic
• Colouring a graph frugally
• Linear coloring of graphs
• Structural theorem on plane graphs with application to the entire coloring number
• Coloring the square of a planar graph

This page was built for publication: Upper bounds on the linear chromatic number of a graph