Bounds on the dynamic chromatic number of a graph in terms of its chromatic number
type: Item
instance of: scholarly article
title: Bounds on the dynamic chromatic number of a graph in terms of its chromatic number
zbMATH Open document ID: 1395.05064
author: Y. Aharonov
published in: Journal of Mathematical Sciences (New York)
publication date: 2018-08-16T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6919668
zbMATH Keywords: dynamic vertex coloring
MaRDI profile type: Publication
full work available at URL: s10958-018-3855-4
OpenAlex ID: W2804029448
cites work: Q5782525
cites work: Q5466088
cites work: On the list dynamic coloring of graphs
cites work: Q3001393
cites work: On proper colorings of hypergraphs
cites work: An analog of Brooks' theorem for dynamic colorings
cites work: On the difference between chromatic number and dynamic chromatic number of graphs
cites work: Dynamic coloring and list dynamic coloring of planar graphs
DOI: 10.1007/S10958-018-3855-4
description: scientific article; zbMATH DE number 6919668