Optimal \(r\)-dynamic coloring of sparse graphs
From MaRDI portal
Publication:2424825
DOI10.1007/s10878-019-00387-0zbMath1420.05064OpenAlexW2915468158MaRDI QIDQ2424825
Jiaxin Wang, Junlei Zhu, Dan Yi, Mengyini Yang, Li Xia Feng
Publication date: 25 June 2019
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-019-00387-0
Related Items (2)
The \(r\)-dynamic chromatic number of planar graphs without special short cycles ⋮ List \(r\)-dynamic coloring of sparse graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \(r\)-dynamic coloring of graphs
- A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
- On \(r\)-hued coloring of \(K_4\)-minor free graphs
- On dynamic coloring for planar graphs and graphs of higher genus
- Minimum choosability of planar graphs
- Minimum 2-distance coloring of planar graphs and channel assignment
- 2-distance vertex-distinguishing index of subcubic graphs
- On \(r\)-hued coloring of planar graphs with girth at least 6
- Edge coloring of planar graphs without adjacent 7-cycles
- The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
- Vertex arboricity of planar graphs without intersecting 5-cycles
- Upper bounds for adjacent vertex-distinguishing edge coloring
- Planar graphs without chordal 5-cycles are 2-good
- An optimal square coloring of planar graphs
- The entire chromatic number of graphs embedded on the torus with large maximum degree
- Dynamic coloring and list dynamic coloring of planar graphs
- Conditional colorings of graphs
- Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable
This page was built for publication: Optimal \(r\)-dynamic coloring of sparse graphs
