[1] Meysam Alishahi, On the dynamic coloring of graphs, Discrete
Applied Mathematics 159 (2011), 152-156.
[2] J. A. Bondy and U. S. R. Murty, Graph Theory with Applications,
Elsevier North Holland, 1981.
[3] C. Ding, S. Fan and H.-J. Lai, Upper bound on conditional
chromatic number of graphs, J. of Jinan University 29 (2008), 7-14.
[4] Louis Esperet, Dynamic list coloring of bipartite graphs, Discrete
Applied Mathematics 158 (2010), 1963-1965.
[5] H.-J. Lai, J. Lin, B. Montgomery, Z. Tao and S. Fan, Conditional
colorings of graphs, Discrete Mathematics 306 (2006), 1997-2004.
[6] H.-J. Lai, B. Montgomery and H. Poon, Upper bounds of dynamic
chromatic number, Ars Combinatoria 68 (2003), 193-201.
[7] Xueliang Li, Xiangmei Yao, Wenli Zhou and Hajo Broersma,
Complexity of conditional colorability of graphs, Applied Mathematics
Letter 22 (2009), 320-324.
[8] Yue Lin, Upper Bounds of Conditional Chromatics Number, Master
Thesis, Jinan University, 2008.
[9] B. Montgomery, Dynamic Coloring of Graphs, Ph.D. Thesis, West
Virginia University, 2001.