\(r\)-hued coloring of sparse graphs

DOI10.1016/j.dam.2017.11.033zbMath1380.05056OpenAlexW2777927177MaRDI QIDQ1701096

Cun-Quan Zhang, Jian Cheng, Rong Luo, Kate J. Lorenzen, Joshua C. Thompson, Hong-Jian Lai

Publication date: 22 February 2018

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

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

zbMATH Keywords

discharging methodmaximum average degree\((k, r)\)-coloring

Mathematics Subject Classification ID

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

Related Items (6)

Graph \(r\)-hued colorings -- a survey ⋮ On list 3-dynamic coloring of near-triangulations ⋮ \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\) ⋮ List \(r\)-dynamic coloring of graphs with small maximum average degree ⋮ 3-dynamic coloring of planar triangulations ⋮ List \(r\)-dynamic coloring of sparse graphs

Cites Work

• On \(r\)-hued coloring of \(K_4\)-minor free graphs
• On dynamic coloring for planar graphs and graphs of higher genus
• On \(r\)-hued coloring of planar graphs with girth at least 6
• Dynamic coloring and list dynamic coloring of planar graphs
• List Dynamic Coloring of Sparse Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: \(r\)-hued coloring of sparse graphs