On \(r\)-hued coloring of planar graphs with girth at least 6

DOI10.1016/j.dam.2015.05.015zbMath1327.05085OpenAlexW969137341MaRDI QIDQ897613

Hong-Jian Lai, Huimin Song, Jian Liang Wu

Publication date: 7 December 2015

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

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

zbMATH Keywords

girthplanar graph\(r\)-hued coloring\((k, r)\)-coloring

Mathematics Subject Classification ID

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

Related Items (23)

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 ⋮ Decomposition and \(r\)-hued coloring of \(K_4(7)\)-minor free graphs ⋮ On \(r\)-hued colorings of graphs without short induced paths ⋮ Optimal \(r\)-dynamic coloring of sparse graphs ⋮ The \(r\)-dynamic chromatic number of planar graphs without special short cycles ⋮ \(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 ⋮ \(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 ⋮ 3-dynamic coloring and list 3-dynamic coloring of \(K_{1, 3}\)-free graphs ⋮ 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 ⋮ The \(r\)-dynamic chromatic number of planar graphs without 4-,5-cycles ⋮ The structure and the list 3-dynamic coloring of outer-1-planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On \(r\)-hued coloring of \(K_4\)-minor free graphs
• On dynamic coloring for planar graphs and graphs of higher genus
• Complexity of conditional colorability of graphs
• Coloring the square of a \(K_{4}\)-minor free graph
• An optimal square coloring of planar graphs
• Conditional colorings of graphs

This page was built for publication: On \(r\)-hued coloring of planar graphs with girth at least 6