Linear list r-hued coloring of sparse graphs

DOI10.1142/S1793830918500453zbMath1393.05121OpenAlexW2795624068MaRDI QIDQ4577851

Murong Xu, Jiangxu Kong, Xiaoxue Hu, Hongping Ma

Publication date: 3 August 2018

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830918500453

zbMATH Keywords

list coloringdischarging methodmaximum average degreelinear coloring\(r\)-hued coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

The structure and the list 3-dynamic coloring of outer-1-planar graphs

Cites Work

• On \(r\)-hued coloring of \(K_4\)-minor free graphs
• On dynamic coloring for planar graphs and graphs of higher genus
• Dynamic list coloring of bipartite graphs
• On the dynamic coloring of graphs
• On \(r\)-hued coloring of planar graphs with girth at least 6
• Linear choosability of graphs
• On the list dynamic coloring of graphs
• Complexity of conditional colorability of graphs
• Linear coloring of graphs
• Linear choosability of sparse graphs
• On \(r\)-dynamic coloring of grids
• Conditional colorings of graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Linear list r-hued coloring of sparse graphs