Browsing by Subject "Graph partitioning"
Now showing items 1-1 of 1
-
Acyclic edge coloring of complete r-partite graphs
(Dhirubhai Ambani Institute of Information and Communication Technology, 2011)An acyclic edge coloring of a graph G is a proper edge coloring of G which has no dichromatic cycle. The minimum number of colors required to acyclically edge color graph G is called its acyclic chromatic index, denoted ...