List \(r\)-dynamic coloring of sparse graphs
From MaRDI portal
Publication:2309401
DOI10.1016/j.tcs.2019.05.032zbMath1472.05060OpenAlexW2955020584MaRDI QIDQ2309401
Publication date: 1 April 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.05.032
Related Items (5)
Graph \(r\)-hued colorings -- a survey ⋮ A note on global dominator coloring of graphs ⋮ Unnamed Item ⋮ Incidence coloring of mycielskians with fast algorithm ⋮ The structure and the list 3-dynamic coloring of outer-1-planar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- On \(r\)-dynamic coloring of graphs
- 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
- \(T\)-colorings of graphs: recent results and open problems
- On list \(r\)-hued coloring of planar graphs
- Dynamic coloring parameters for graphs with given genus
- \(r\)-hued coloring of sparse graphs
- List 3-dynamic coloring of graphs with small maximum average degree
- List \(r\)-dynamic coloring of graphs with small maximum average degree
- Upper bounds of \(r\)-hued colorings of planar graphs
- 3-dynamic coloring and list 3-dynamic coloring of \(K_{1, 3}\)-free graphs
- An optimal square coloring of planar graphs
- Optimal \(r\)-dynamic coloring of sparse graphs
- Dynamic coloring and list dynamic coloring of planar graphs
- Conditional colorings of graphs
- List-coloring the square of a subcubic graph
- Labelling Graphs with a Condition at Distance 2
- List Dynamic Coloring of Sparse Graphs
This page was built for publication: List \(r\)-dynamic coloring of sparse graphs
