Bounds on the dynamic chromatic number of a graph in terms of its chromatic number
From MaRDI portal
(Redirected from Publication:1661495)
Recommendations
Cites work
- An analog of Brooks' theorem for dynamic colorings
- Dynamic coloring and list dynamic coloring of planar graphs
- scientific article; zbMATH DE number 5901911 (Why is no real title available?)
- scientific article; zbMATH DE number 2197944 (Why is no real title available?)
- scientific article; zbMATH DE number 3043302 (Why is no real title available?)
- On proper colorings of hypergraphs
- On the difference between chromatic number and dynamic chromatic number of graphs
- On the list dynamic coloring of graphs
Cited in
(8)- A dualistic approach to bounding the chromatic number of a graph
- Dynamic list coloring of 1-planar graphs
- scientific article; zbMATH DE number 5901911 (Why is no real title available?)
- Dynamic chromatic number of unicyclic graphs and bicyclic graphs
- On the difference between chromatic number and dynamic chromatic number of graphs
- On r-dynamic chromatic number of some brick product graphs C(2n, 1, p)
- scientific article; zbMATH DE number 2197944 (Why is no real title available?)
- Tight bounds for the N₂-chromatic number of graphs
This page was built for publication: Bounds on the dynamic chromatic number of a graph in terms of its chromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1661495)
