On r-hued coloring of planar graphs with girth at least 6
From MaRDI portal
Publication:897613
Recommendations
Cites work
- scientific article; zbMATH DE number 2197944 (Why is no real title available?)
- An optimal square coloring of planar graphs
- Coloring the square of a \(K_{4}\)-minor free graph
- Complexity of conditional colorability of graphs
- Conditional colorings of graphs
- Graph theory
- On \(r\)-hued coloring of \(K_4\)-minor free graphs
- On dynamic coloring for planar graphs and graphs of higher genus
Cited in
(27)- Element deletion changes in dynamic coloring of graphs
- Upper bounds of \(r\)-hued colorings of planar graphs
- The structure and the list 3-dynamic coloring of outer-1-planar graphs
- On \(r\)-hued coloring of planar graphs
- On \(r\)-dynamic coloring of para-line graph of some standard graphs
- On list 3-dynamic coloring of near-triangulations
- On \(r\)-hued colorings of graphs without short induced paths
- On \(r\)-hued coloring of planar graphs with girth at least 5
- Linear list r-hued coloring of sparse graphs
- \(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
- 3-dynamic coloring and list 3-dynamic coloring of \(K_{1, 3}\)-free graphs
- scientific article; zbMATH DE number 5952407 (Why is no real title available?)
- \(r\)-hued coloring of planar graphs without short cycles
- Graph \(r\)-hued colorings -- a survey
- On the \(r\)-dynamic coloring of subdivision-edge coronas of a path
- List \(r\)-hued chromatic number of graphs with bounded maximum average degrees
- List 3-dynamic coloring of graphs with small maximum average degree
- On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs
- Decomposition and \(r\)-hued coloring of \(K_4(7)\)-minor free graphs
- 3-dynamic coloring of planar triangulations
- \(r\)-hued coloring of sparse graphs
- List \(r\)-dynamic coloring of graphs with small maximum average degree
- Optimal \(r\)-dynamic coloring of sparse graphs
- The \(r\)-dynamic chromatic number of planar graphs without special short cycles
This page was built for publication: On \(r\)-hued coloring of planar graphs with girth at least 6
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897613)