论文信息 - On the dynamic coloring of graphs

On the dynamic coloring of graphs

A dynamic coloring of a graph G is a proper coloring such that, for every vertex v@?V(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, for every k-regular graph G, @g"2(G)@?@g(G)+14.06lnk+1. Also, we introduce an upper bound for the dynamic list chromatic number of regular graphs.

Meysam Alishahi

[1] N. Alon,et al. Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2004 .

[2] Hong-Jian Lai,et al. Upper Bounds of Dynamic Chromatic Number , 2003, Ars Comb..

[3] Colin McDiarmid,et al. Hypergraph colouring and the Lovász Local Lemma , 1997, Discret. Math..

[4] Carsten Thomassen. The even cycle problem for directed graphs , 1992 .

[5] Elzbieta Sidorowicz,et al. Dynamic Coloring of Graphs , 2012, Fundam. Informaticae.

[6] László Lovász,et al. Kneser's Conjecture, Chromatic Number, and Homotopy , 1978, J. Comb. Theory A.

[7] Louis Esperet,et al. Dynamic list coloring of bipartite graphs , 2010, Discret. Appl. Math..

[8] Bruce Montgomery. Dynamic coloring of graphs , 2002 .

[9] S. Akbari,et al. On the list dynamic coloring of graphs , 2009, Discret. Appl. Math..

[10] Hong-Jian Lai,et al. Conditional colorings of graphs , 2006, Discret. Math..

[11] Lianying Miao,et al. The Dynamic Coloring Numbers of Pseudo-Halin Graphs , 2006, Ars Comb..

[12] M. Kneser,et al. Ein Satz über abelsche Gruppen mit Anwendungen auf die Geometrie der Zahlen , 1954 .