Element deletion changes in dynamic coloring of graphs
From MaRDI portal
Recommendations
Cites work
- An inequality for the group chromatic number of a graph
- 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
- scientific article; zbMATH DE number 2197944 (Why is no real title available?)
- On r-hued coloring of K₄-minor free graphs
- 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
(5)- Graph \(r\)-hued colorings -- a survey
- scientific article; zbMATH DE number 1161310 (Why is no real title available?)
- On the difference between chromatic number and dynamic chromatic number of graphs
- The structure and the list 3-dynamic coloring of outer-1-planar graphs
- The r-dynamic chromatic number is bounded in the strong 2-coloring number
This page was built for publication: Element deletion changes in dynamic coloring of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q271647)