3-dynamic coloring and list 3-dynamic coloring of \(K_{1, 3}\)-free graphs
From MaRDI portal
Publication:1786882
DOI10.1016/j.dam.2017.01.006zbMath1396.05041OpenAlexW2589003342MaRDI QIDQ1786882
Publication date: 25 September 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.01.006
Related Items (7)
Graph \(r\)-hued colorings -- a survey ⋮ On \(r\)-hued colorings of graphs without short induced paths ⋮ On list 3-dynamic coloring of near-triangulations ⋮ List \(r\)-dynamic coloring of graphs with small maximum average degree ⋮ 3-dynamic coloring of planar triangulations ⋮ List \(r\)-dynamic coloring of sparse graphs ⋮ The structure and the list 3-dynamic coloring of outer-1-planar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- On dynamic coloring for planar graphs and graphs of higher genus
- Dynamic list coloring of bipartite graphs
- On the dynamic coloring of graphs
- Group connectivity in line graphs
- On \(r\)-hued coloring of planar graphs with girth at least 6
- On the list dynamic coloring of graphs
- Complexity of conditional colorability of graphs
- Dynamic coloring and list dynamic coloring of planar graphs
- Conditional colorings of graphs
This page was built for publication: 3-dynamic coloring and list 3-dynamic coloring of \(K_{1, 3}\)-free graphs