On Acyclic Edge-Coloring of Complete Bipartite Graphs

Ayineedi Venkateswarlu, Santanu Sarkar, A. Sai Mali

An acyclic edge-coloring of a graph is a proper edge-coloring without bichromatic ($2$-colored) cycles. The acyclic chromatic index of a graph $G$, denoted by $a^{\prime }(G)$, is the least…