Linear choosability of sparse graphs
From MaRDI portal
Publication:2275448
DOI10.1016/j.disc.2011.05.017zbMath1225.05095arXiv1007.1615MaRDI QIDQ2275448
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
05C15: Coloring of graphs and hypergraphs
Related Items
Linear list r-hued coloring of sparse graphs, On linear coloring of planar graphs with small girth, Linear coloring of sparse graphs, A result on linear coloring of planar graphs, An introduction to the discharging method via graph coloring, Linear and 2-frugal choosability of graphs of small maximum average degree, \(k\)-forested choosability of planar graphs and sparse graphs, Linear list coloring of some sparse graphs, Linear colorings of subcubic graphs
Cites Work