A note on acyclic edge coloring of complete bipartite graphs (Q1044002): Difference between revisions

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic (\(2\)-coloured) cycles. The acyclic chromatic index of a graph is the minimum number \(k\) such that there is an acyclic edge coloring using \(k\) colors and is denoted by \(a^\prime(G)\). It is proved that \(a^\prime(K_{p,p})=p+2=\Delta+2\) when p is an odd prime. Moreover, after removing any edge from \(K_{p,p}\), the resulting graph is acyclically \(\Delta+1=p+1\)-edge-colourable.