Linear choosability of sparse graphs

DOI10.1016/j.disc.2011.05.017zbMath1225.05095arXiv1007.1615OpenAlexW2141381908MaRDI QIDQ2275448

Gexin Yu, Daniel W. Cranston

Publication date: 9 August 2011

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

Full work available at URL: https://arxiv.org/abs/1007.1615

zbMATH Keywords

planar graphlist coloringdischarging methodmaximum average degreelinear coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

List-recoloring of sparse graphs ⋮ Linear list r-hued coloring of sparse graphs ⋮ On linear coloring of planar graphs with small girth ⋮ Linear coloring of sparse graphs ⋮ Linear list coloring of some sparse graphs ⋮ A result on linear coloring of planar graphs ⋮ Linear colorings of subcubic graphs ⋮ Linear and 2-frugal choosability of graphs of small maximum average degree ⋮ An introduction to the discharging method via graph coloring ⋮ \(k\)-forested choosability of planar graphs and sparse graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Linear choosability of graphs
• Linear coloring of planar graphs with large girth
• Colouring a graph frugally
• Linear coloring of graphs
• Acyclic colorings of planar graphs
• 25 pretty graph colouring problems