Acyclic edge coloring of complete r-partite graphs

dc.accession.number	T00323
dc.classification.ddc	511.56 TEJ
dc.contributor.advisor	Muthu, Rahul
dc.contributor.author	Teja, V. Krishna
dc.date.accessioned	2017-06-10T14:39:18Z
dc.date.accessioned	2025-06-28T10:30:22Z
dc.date.available	2017-06-10T14:39:18Z
dc.date.issued	2011
dc.degree	M. Tech
dc.description.abstract	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 a’ (G). In this thesis, we present an acyclic edge coloring for complete graphs Ka, b, where a>b and a is prime, using Δ (G) =a colors. An acyclic edge coloring for complete tripartite graphs, and r-partite graphs (r>3) is presented. These colorings follow patterns similar to those used in the case of complet bipartite graphs.
dc.identifier.citation	Teja, V. Krishna (2011). Acyclic edge coloring of complete r-partite graphs. Dhirubhai Ambani Institute of Information and Communication Technology, iv, 45 p. (Acc.No: T00323)
dc.identifier.uri	http://ir.daiict.ac.in/handle/123456789/360
dc.publisher	Dhirubhai Ambani Institute of Information and Communication Technology
dc.student.id	200911042
dc.subject	Graph theory
dc.subject	Map-coloring problem
dc.subject	Graph coloring
dc.subject	Algorithms
dc.subject	Graph partitioning
dc.title	Acyclic edge coloring of complete r-partite graphs
dc.type	Dissertation

Files

Now showing 1 - 1 of 1