A note on acyclic edge coloring of complete bipartite graphs
From MaRDI portal
Publication:1044002
DOI10.1016/j.disc.2009.01.014zbMath1192.05044OpenAlexW2083336308MaRDI QIDQ1044002
Manu Basavaraju, L. Sunil Chandran
Publication date: 10 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.01.014
Related Items (7)
Some results on acyclic edge coloring of plane graphs ⋮ Improved bounds on coloring of graphs ⋮ On acyclic edge coloring of toroidal graphs ⋮ Acyclic edge coloring of planar graphs with \(\varDelta\) colors ⋮ On acyclic edge-coloring of the complete bipartite graphs \(K_{2p-1, 2p-1}\) for odd prime \(p\) ⋮ On acyclic edge-coloring of complete bipartite graphs ⋮ Edge-colouring of graphs and hereditary graph properties
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Acyclic colorings of subcubic graphs
- A family of perfect factorisations of complete bipartite graphs
- Acyclic edge colorings of graphs
- Optimal Acyclic Edge Colouring of Grid Like Graphs
- The acyclic edge chromatic number of a random d‐regular graph is d + 1
- d‐Regular graphs of acyclic chromatic index at least d+2
- Acyclic Edge Colouring of Outerplanar Graphs
- Primes in short intervals
- Acyclic colorings of planar graphs
This page was built for publication: A note on acyclic edge coloring of complete bipartite graphs