Linear coloring of sparse graphs

DOI10.1016/J.DAM.2011.10.028zbMath1239.05076OpenAlexW1997466557MaRDI QIDQ412383

Qian Wu, Ying Qian Wang

Publication date: 4 May 2012

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

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

zbMATH Keywords

girthmaximum degreemaximum average degreelinear coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)

Related Items (4)

On linear coloring of planar graphs with small girth ⋮ Linear list coloring of some sparse graphs ⋮ Linear colorings of subcubic graphs ⋮ The linear \(t\)-colorings of Sierpiński-like graphs

Cites Work

• Improved bounds on linear coloring of plane graphs
• Linear choosability of graphs
• Linear coloring of graphs embeddable in a surface of nonnegative characteristic
• Linear coloring of graphs
• Linear choosability of sparse graphs

This page was built for publication: Linear coloring of sparse graphs