On the dynamic coloring of graphs

From MaRDI portal




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.




Cited in
(49)






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)