On dynamic coloring for planar graphs and graphs of higher genus
DOI10.1016/J.DAM.2012.01.012zbMATH Open1243.05079OpenAlexW2155793958MaRDI QIDQ423914FDOQ423914
Authors: Ye Chen, Suohai Fan, Hong-Jian Lai, Huimin Song, Lei Sun 
Publication date: 30 May 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.01.012
Recommendations
dynamic chromatic number\((k, r)\)-coloring\(r\)-hued chromatic numberdynamic choice numberHeawood coloring theorem
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Graph theory
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- The four-colour theorem
- Conditional colorings of graphs
- Title not available (Why is that?)
- Dynamic list coloring of bipartite graphs
- On the dynamic coloring of graphs
- On the list dynamic coloring of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Six Color Problem
Cited In (27)
- Weak-dynamic coloring of graphs beyond-planarity
- 3-dynamic coloring and list 3-dynamic coloring of \(K_{1, 3}\)-free graphs
- Element deletion changes in dynamic coloring of graphs
- On \(r\)-hued coloring of \(K_4\)-minor free graphs
- Dynamic coloring of graphs having no \(K_5\) minor
- On \(r\)-hued coloring of planar graphs with girth at least 6
- List \(r\)-hued chromatic number of graphs with bounded maximum average degrees
- List \(r\)-dynamic coloring of graphs with small maximum average degree
- On the list dynamic coloring of graphs
- On \(r\)-hued colorings of graphs without short induced paths
- Dynamic coloring parameters for graphs with given genus
- Dynamic coloring on restricted graph classes
- Dynamic coloring and list dynamic coloring of planar graphs
- Adynamic coloring of graphs
- On list \(r\)-hued coloring of planar graphs
- Upper bounds of \(r\)-hued colorings of planar graphs
- On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs
- Graph \(r\)-hued colorings -- a survey
- Decomposition and \(r\)-hued coloring of \(K_4(7)\)-minor free graphs
- List dynamic 4-coloring of planar graphs
- List \(r\)-dynamic coloring of sparse graphs
- A counterexample to montgomery's conjecture on dynamic colourings of regular graphs
- \(r\)-hued coloring of sparse graphs
- Dynamic list coloring of 1-planar graphs
- Optimal \(r\)-dynamic coloring of sparse graphs
- 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\)
This page was built for publication: On dynamic coloring for planar graphs and graphs of higher genus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q423914)
