### On r-dynamic coloring of some graph operations

#### Abstract

#### Keywords

#### Full Text:

PDF#### References

J.L. Gross, J. Yellen and P. Zhang, Handbook of Graph Theory, Second Edition, CRC Press, Taylor and Francis Group, 2014

S.J. Kim and W.J. Park, List dynamic coloring of sparse graphs, Combinatorial optimization and applications. Lect. Notes Comput. Sci. 6831 (Springer, 2011), 156– 162.

S.J. Kim, S. J. Lee, and W.J. Park, Dynamic coloring and list dynamic coloring of planar graphs. Discrete Applied Math. 161 (2013), 2207–2212.

S. Akbari, M. Ghanbari, S. Jahanbekam, On the dynamic chromatic number of graphs, Combinatorics and graphs. Contemp. Math. 531 (Amer. Math. Soc. 2010), 1–18.

B. Montgomery, Dynamic Coloring of Graphs. Ph.D Dissertation, West Virginia University, 2001.

H.J. Lai, B. Montgomery, and H. Poon, Upper bounds of dynamic

chromatic number. Ars Combin. 68 (2003), 193–201.

S Jahanbekam, J Kim, O Suil, D.B. West, On r-dynamic Coloring of Graphs, 2014, In Press

R.L. Brooks, On colouring the nodes of a network. Proc. Cambridge Philos. Soc. 37 (1941), 194–197.

DOI: http://dx.doi.org/10.19184/ijc.2016.1.1.3

### Refbacks

- There are currently no refbacks.

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.