On the dynamic coloring of graphs

From MaRDI portal
Publication:617650

DOI10.1016/J.DAM.2010.10.012zbMATH Open1203.05046arXiv0908.2543OpenAlexW2074480183MaRDI QIDQ617650FDOQ617650

Meysam Alishahi

Publication date: 21 January 2011

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

Abstract: A dynamic coloring of a graph G is a proper coloring such that for every vertex vinV(G) of degree at least 2, the neighbors of v receive at least 2 colors. In this paper we present some upper bounds for the dynamic chromatic number of graphs. In this regard, we shall show that there is a constant c such that for every k-regular graph G, chid(G)leqchi(G)+clnk+1. Also, we introduce an upper bound for the dynamic list chromatic number of regular graphs.


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




Recommendations




Cites Work


Cited In (39)





This page was built for publication: On the dynamic coloring of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q617650)