3-dynamic coloring and list 3-dynamic coloring of K₁, 3-free graphs
From MaRDI portal
Publication:1786882
Recommendations
- The structure and the list 3-dynamic coloring of outer-1-planar graphs
- On list 3-dynamic coloring of near-triangulations
- List 3-dynamic coloring of graphs with small maximum average degree
- On the list dynamic coloring of graphs
- Dynamic coloring and list dynamic coloring of planar graphs
- On uniquely 3-list colorable graphs
- Obstructions for three-coloring and list three-coloring H-free graphs
- 3-dynamic coloring of planar triangulations
- List \(r\)-dynamic coloring of sparse graphs
- Dynamic \(F\)-free coloring of graphs
Cites work
- Complexity of conditional colorability of graphs
- Conditional colorings of graphs
- Dynamic coloring and list dynamic coloring of planar graphs
- Dynamic list coloring of bipartite graphs
- Graph theory
- Group connectivity in line graphs
- scientific article; zbMATH DE number 2197944 (Why is no real title available?)
- On \(r\)-hued coloring of planar graphs with girth at least 6
- On dynamic coloring for planar graphs and graphs of higher genus
- On the dynamic coloring of graphs
- On the list dynamic coloring of graphs
Cited in
(11)- List r-dynamic coloring of graphs with small maximum average degree
- 3-dynamic coloring of planar triangulations
- Graph \(r\)-hued colorings -- a survey
- On list 3-dynamic coloring of near-triangulations
- List \(r\)-dynamic coloring of sparse graphs
- On \(r\)-hued colorings of graphs without short induced paths
- The structure and the list 3-dynamic coloring of outer-1-planar graphs
- List 3-dynamic colorings of planar graphs
- The list r-hued coloring of P₅-free graph
- r-dynamic colorings and the spectral radius in graphs
- On r-hued coloring of connected P₅-free tripartite graphs
This page was built for publication: 3-dynamic coloring and list 3-dynamic coloring of \(K_{1, 3}\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1786882)
