Further Results on Acyclic Chromatic Number ()
Abstract
An acyclic coloring of a
graph is a proper vertex coloring such that the union of any two color classes
induces a disjoint collection of trees.The purpose of
this paper is to derive exact values of acyclic chromatic number of some graphs.
Share and Cite:
P. Babu and A. Chithra, "Further Results on Acyclic Chromatic Number,"
Open Journal of Discrete Mathematics, Vol. 3 No. 2, 2013, pp. 97-100. doi:
10.4236/ojdm.2013.32019.
Conflicts of Interest
The authors declare no conflicts of interest.
References
|
[1]
|
B. Grünbaum, “Acyclic Colorings of Planar Graphs,” Israel Journal of Mathematics, Vol. 14, No. 3, 1973, pp. 390-408. doi:10.1007/BF02764716
|
|
[2]
|
P. S. Babu and A. V. Chithra, “Acyclic Colouring of Line Graph of Some Families”,Proceedings of National Conference on Mathematics of Soft Computing (NCMSC 2012), 5-7 July, 2012, National Institute of Technology (NIT), Calicut, Kerala, India, pp. 144-147.
|
|
[3]
|
D. Michalak, “On Middle and Total Graphs with Coarseness Number Equal 1,” Lecture Notes in Mathematics, Vol. 1018, 1983, pp. 139-150.
|