On \(r\)-hued coloring of \(K_4\)-minor free graphs

DOI10.1016/j.disc.2013.10.001zbMath1278.05109OpenAlexW1998680513MaRDI QIDQ393165

Suohai Fan, Hong-Jian Lai, Huimin Song, Ye Chen, Lei Sun

Publication date: 16 January 2014

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

Full work available at URL: https://doi.org/10.1016/j.disc.2013.10.001

zbMATH Keywords

planar graph(\(k\(r\)-hued coloring\(r\)-hued list coloringr\))-coloring

Mathematics Subject Classification ID

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

Related Items

Element deletion changes in dynamic coloring of graphs ⋮ On the \(r\)-dynamic coloring of subdivision-edge coronas of a path ⋮ Graph \(r\)-hued colorings -- a survey ⋮ Linear list r-hued coloring of sparse graphs ⋮ On list \(r\)-hued coloring of planar graphs ⋮ Dynamic coloring parameters for graphs with given genus ⋮ Decomposition and \(r\)-hued coloring of \(K_4(7)\)-minor free graphs ⋮ On \(r\)-hued colorings of graphs without short induced paths ⋮ On \(r\)-hued coloring of planar graphs with girth at least 6 ⋮ Optimal \(r\)-dynamic coloring of sparse graphs ⋮ \(r\)-hued coloring of sparse graphs ⋮ On list 3-dynamic coloring of near-triangulations ⋮ List \(r\)-hued chromatic number of graphs with bounded maximum average degrees ⋮ List 3-dynamic coloring of graphs with small maximum average degree ⋮ Unnamed Item ⋮ \(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 ⋮ Upper bounds of \(r\)-hued colorings of planar graphs ⋮ Unnamed Item ⋮ 3-dynamic coloring of planar triangulations ⋮ r-Hued coloring of planar graphs without short cycles ⋮ List \(r\)-dynamic coloring of sparse graphs ⋮ On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs ⋮ On list \(r\)-hued coloring of outer-1-planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On dynamic coloring for planar graphs and graphs of higher genus
• Dynamic list coloring of bipartite graphs
• On the list dynamic coloring of graphs
• Complexity of conditional colorability of graphs
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• The four-colour theorem
• Coloring the square of a \(K_{4}\)-minor free graph
• Topology of series-parallel networks
• Conditional colorings of graphs

This page was built for publication: On \(r\)-hued coloring of \(K_4\)-minor free graphs