Further Results on Acyclic Chromatic Number

Further Results on Acyclic Chromatic Number

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Open journal of discrete mathematics 2013-04, Vol.3 (2), p.97-100
Hauptverfasser: Babu, P. Shanas, Chithra, A. V.
Format: Artikel
Sprache:eng
Schlagworte:
Collection
Color
Coloring
Graphs
Mathematical analysis
Unions
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:2161-7635
2161-7643
DOI:10.4236/ojdm.2013.32019