Upper bounds of r-hued colorings of planar graphs
From MaRDI portal
Publication:1752467
Recommendations
Cites work
- scientific article; zbMATH DE number 2197944 (Why is no real title available?)
- Coloring the square of a \(K_{4}\)-minor free graph
- Coloring the square of a planar graph
- Complexity of conditional colorability of graphs
- Conditional colorings of graphs
- Dynamic coloring and list dynamic coloring of planar graphs
- Dynamic coloring parameters for graphs with given genus
- Graph theory with applications
- On \(r\)-hued coloring of \(K_4\)-minor free graphs
- On \(r\)-hued coloring of planar graphs with girth at least 6
- On dynamic coloring for planar graphs and graphs of higher genus
Cited in
(17)- On r-hued coloring of product graphs
- The structure and the list 3-dynamic coloring of outer-1-planar graphs
- On \(r\)-hued coloring of planar graphs
- On \(r\)-hued coloring of planar graphs with girth at least 5
- The list \(r\)-hued coloring of \(K_{m, n}\)
- Wegner's conjecture on 2-distance coloring
- \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\)
- The \(r\)-dynamic chromatic number of planar graphs without 4-,5-cycles
- 3-hued coloring of planar graphs
- List \(r\)-dynamic coloring of sparse graphs
- On list \(r\)-hued coloring of planar graphs
- On \(r\)-hued coloring of planar graphs with girth at least 6
- Graph \(r\)-hued colorings -- a survey
- On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs
- Wegner's conjecture on 2-distance coloring for planar graphs
- Decomposition and \(r\)-hued coloring of \(K_4(7)\)-minor free graphs
- The \(r\)-dynamic chromatic number of planar graphs without special short cycles
This page was built for publication: Upper bounds of \(r\)-hued colorings of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752467)