On Acyclic Edge-Coloring of Complete Bipartite Graphs
Abstract: An acyclic edge-coloring of a graph is a proper edge-coloring without bichromatic ($2$-colored) cycles. The acyclic chromatic index of a graph , denoted by , is the least integer such that admits an acyclic edge-coloring using colors. Let denote the maximum degree of a vertex in a graph . A complete bipartite graph with vertices on each side is denoted by . Basavaraju, Chandran and Kummini proved that when is odd. Basavaraju and Chandran provided an acyclic edge-coloring of using colors and thus establishing when is an odd prime. The main tool in their approach is perfect $1$-factorization of . Recently, following their approach, Venkateswarlu and Sarkar have shown that admits an acyclic edge-coloring using $2p+1$ colors which implies that , where is an odd prime. In this paper, we generalize this approach and present a general framework to possibly get an acyclic edge-coloring of which possess a perfect $1$-factorization using colors. In this general framework, we show that admits an acyclic edge-coloring using colors and thus establishing when is an odd prime.
Paper Prompts
Sign up for free to create and run prompts on this paper.