On Acyclic Edge-Coloring of Complete Bipartite Graphs
Ayineedi Venkateswarlu, Santanu Sarkar, A. Sai Mali

TL;DR
This paper develops a general framework for acyclic edge-coloring of complete bipartite graphs with perfect 1-factorizations, extending previous results to larger classes and establishing the acyclic chromatic index for certain graphs.
Contribution
It introduces a new general approach to acyclic edge-coloring of $K_{n,n}$ with perfect 1-factorizations, covering cases like $K_{p^2,p^2}$ for odd primes $p \\ge 5$.
Findings
Established $a'(K_{p^2,p^2})=p^2+2$ for odd primes $p \\ge 5$
Extended previous results to a broader class of complete bipartite graphs
Provided a framework potentially applicable to other graphs with perfect 1-factorizations
Abstract
An acyclic edge-coloring of a graph is a proper edge-coloring without bichromatic (-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 -factorization of . Recently, following their approach, Venkateswarlu and Sarkar have shown that admits an acyclic edge-coloring using …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Limits and Structures in Graph Theory · Nuclear Receptors and Signaling
