A counterexample to montgomery's conjecture on dynamic colourings of regular graphs
type: Item
instance of: scholarly article
title: A counterexample to montgomery's conjecture on dynamic colourings of regular graphs
zbMATH Open document ID: 1367.05068
author: Nathan Bowler
author: Joshua Erde
author: Florian Lehner
author: Martin Merker
author: Max F. Pitz
author: Konstantinos S. Stavropoulos
published in: Discrete Applied Mathematics
publication date: 2017-07-27T00:00:00Z
full work available at URL: https://arxiv.org/abs/1702.00973
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6754400
zbMATH Keywords: graph colouring
zbMATH Keywords: dynamic colouring
MaRDI profile type: Publication
OpenAlex ID: W2602246102
arXiv ID: 1702.00973
cites work: On the difference between chromatic number and dynamic chromatic number of graphs
cites work: On the list dynamic coloring of graphs
cites work: Q3001393
cites work: On the dynamic coloring of graphs
cites work: Dynamic chromatic number of regular graphs
cites work: On dynamic coloring for planar graphs and graphs of higher genus
cites work: Disjoint independent dominating sets in graphs
cites work: Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number
cites work: On \(r\)-dynamic coloring of graphs
cites work: On \(r\)-dynamic coloring of grids
cites work: Dynamic coloring of graphs having no \(K_5\) minor
cites work: Q5466088
cites work: Q4766997
cites work: Coverings by minimal transversals
cites work: On \(r\)-dynamic chromatic number of graphs
Wikidata QID: Q123238184
DOI: 10.1016/J.DAM.2017.05.004
description: scientific article