On list \(r\)-hued coloring of planar graphs

DOI10.1007/s10878-017-0118-0zbMath1385.05035OpenAlexW2591492772MaRDI QIDQ1680495

Peng Zhang

Publication date: 16 November 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0118-0

zbMATH Keywords

planar graphs\(r\)-hued coloringWagner's conjecturelist \(r\)-hued coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

On the \(r\)-dynamic coloring of subdivision-edge coronas of a path ⋮ Graph \(r\)-hued colorings -- a survey ⋮ List \(r\)-dynamic coloring of graphs with small maximum average degree ⋮ List \(r\)-dynamic coloring of sparse graphs ⋮ The structure and the list 3-dynamic coloring of outer-1-planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(r\)-hued coloring of \(K_4\)-minor free graphs
• Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable
• On dynamic coloring for planar graphs and graphs of higher genus
• On the list dynamic coloring of graphs
• Choosability of the square of planar subcubic graphs with large girth
• A bound on the chromatic number of the square of a planar graph
• Conditional colorings of graphs
• List Colouring Squares of Planar Graphs

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