References
- Bresar B, Klavzar S, Rall DF. On the packing chromatic number of Cartesian products, hexagonal lattice and trees, Discrete Applied Mathematics, Vol.155(17), pp. 2303-2311 (2007). doi: 10.1016/j.dam.2007.06.008
- Danuta Michalak. On middle and total graphs with coarseness number equal 1, Graph Theory, Proc.Conf., Lag’ow/Pol.1981, Lect.Notes Math.1018, Springer, Berlin, pp. 139-150 (1981).
- Fiala J, Golovach PA. Complexity of the packing coloring problem for trees, Discrete Applied Mathematics, Vol.158(7), pp. 771-778 (2010). doi: 10.1016/j.dam.2008.09.001
- Gallian JA. A dynamic survey of graph labeling, (2009).
- Goddard W, Hedetniemi SM, Hedetniemi ST, Harris JM, Rall DF. Broadcast chromatic number of graphs, Ars Combinatoria, Vol.86, pp. 33-49 (2008).
- Harary F. Graph Theory, Narosa Publishing home, (1969).
- Rajalakshmi K, Venkatachalam M. On packing coloring of double wheel graph families, International Journal of Pure and Applied Mathematics, Vol.119(17), pp. 685-691 (2018).
- Vernold Vivin J, Venkatachalam M, Akbar Ali MM. Achromatic coloring on double star graph families, International Journal of Mathematical Combinatorics, Vol.3, pp. 71-81 (2009).
- Vernold Vivin J. Harmonious coloring of total graphs, n-leaf, central graphs and circumdetic graphs, Bharathiar University, Ph.D Thesis, Coimbatore, India (2007).