Bounds on the dynamic chromatic number of a graph in terms of its chromatic number

DOI10.1007/s10958-018-3855-4zbMath1395.05064OpenAlexW2804029448MaRDI QIDQ1661495

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

zbMATH Keywords

dynamic vertex coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Dynamic list coloring of 1-planar graphs

Cites Work

• On the difference between chromatic number and dynamic chromatic number of graphs
• An analog of Brooks' theorem for dynamic colorings
• On the list dynamic coloring of graphs
• On proper colorings of hypergraphs
• Dynamic coloring and list dynamic coloring of planar graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounds on the dynamic chromatic number of a graph in terms of its chromatic number