A counterexample to montgomery's conjecture on dynamic colourings of regular graphs

DOI10.1016/j.dam.2017.05.004zbMath1367.05068arXiv1702.00973OpenAlexW2602246102WikidataQ123238184 ScholiaQ123238184MaRDI QIDQ2012068

Martin Merker, Joshua Erde, Nathan Bowler, Florian Lehner, Max F. Pitz, Konstantinos S. Stavropoulos

Publication date: 27 July 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.00973

zbMATH Keywords

graph colouringdynamic colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (7)

Dynamic list coloring of 1-planar graphs ⋮ Graph \(r\)-hued colorings -- a survey ⋮ Independent domination, colorings and the fractional idomatic number of a graph ⋮ Weak dynamic coloring of planar graphs ⋮ List \(r\)-hued chromatic number of graphs with bounded maximum average degrees ⋮ 3-dynamic coloring of planar triangulations ⋮ On dynamic coloring of certain cycle-related graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(r\)-dynamic coloring of graphs
• Dynamic coloring of graphs having no \(K_5\) minor
• On dynamic coloring for planar graphs and graphs of higher genus
• On the difference between chromatic number and dynamic chromatic number of graphs
• On the dynamic coloring of graphs
• Dynamic chromatic number of regular graphs
• Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number
• On \(r\)-dynamic chromatic number of graphs
• On the list dynamic coloring of graphs
• Disjoint independent dominating sets in graphs
• Coverings by minimal transversals
• On \(r\)-dynamic coloring of grids

This page was built for publication: A counterexample to montgomery's conjecture on dynamic colourings of regular graphs