Upper bounds of \(r\)-hued colorings of planar graphs
From MaRDI portal
Publication:1752467
DOI10.1016/j.dam.2017.12.041zbMath1387.05098OpenAlexW2792621921MaRDI QIDQ1752467
Publication date: 24 May 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.12.041
planar graphdynamic chromatic numberdynamic coloring\(r\)-hued coloring\((k, r)\)-coloring\(r\)-hued chromatic number
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (11)
Wegner's conjecture on 2-distance coloring ⋮ Wegner's conjecture on 2-distance coloring for planar graphs ⋮ Graph \(r\)-hued colorings -- a survey ⋮ The \(r\)-dynamic chromatic number of planar graphs without special short cycles ⋮ On r-hued coloring of product graphs ⋮ The list \(r\)-hued coloring of \(K_{m, n}\) ⋮ \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\) ⋮ 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
- 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
- Complexity of conditional colorability of graphs
- Coloring the square of a \(K_{4}\)-minor free graph
- Dynamic coloring parameters for graphs with given genus
- Dynamic coloring and list dynamic coloring of planar graphs
- Conditional colorings of graphs
- Coloring the square of a planar graph
- Unnamed Item
- Unnamed Item
This page was built for publication: Upper bounds of \(r\)-hued colorings of planar graphs