Element deletion changes in dynamic coloring of graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2197944 (Why is no real title available?)
- 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
- On \(r\)-hued coloring of \(K_4\)-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
(3)
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)