Linear list coloring of some sparse graphs

DOI10.7151/dmgt.2169zbMath1453.05033OpenAlexW2897549577WikidataQ129053792 ScholiaQ129053792MaRDI QIDQ2214305

Li Zhang, Ming Chen, Yusheng Li

Publication date: 8 December 2020

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2169

zbMATH Keywords

planar graphsdischargingmaximum average degreelinear coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• On linear coloring of planar graphs with small girth
• Linear coloring of sparse graphs
• 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
• Linear choosability of sparse graphs
• Linear colorings of subcubic graphs

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