Bounds on the dynamic chromatic number of a graph in terms of its chromatic number
From MaRDI portal
Publication:1661495
DOI10.1007/S10958-018-3855-4zbMATH Open1395.05064OpenAlexW2804029448MaRDI QIDQ1661495FDOQ1661495
Authors: Y. Aharonov 
Publication date: 16 August 2018
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-018-3855-4
Recommendations
Cites Work
- Title not available (Why is that?)
- Dynamic coloring and list dynamic coloring of planar graphs
- Title not available (Why is that?)
- On the list dynamic coloring of graphs
- Title not available (Why is that?)
- On the difference between chromatic number and dynamic chromatic number of graphs
- An analog of Brooks' theorem for dynamic colorings
- On proper colorings of hypergraphs
Cited In (8)
- Tight bounds for the \(N_2\)-chromatic number of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the difference between chromatic number and dynamic chromatic number of graphs
- Dynamic chromatic number of unicyclic graphs and bicyclic graphs
- Dynamic list coloring of 1-planar graphs
- A dualistic approach to bounding the chromatic number of a graph
- On r-dynamic chromatic number of some brick product graphs C(2n, 1, p)
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)
