A note on acyclic edge coloring of complete bipartite graphs
From MaRDI portal
Publication:1044002
DOI10.1016/J.DISC.2009.01.014zbMATH Open1192.05044OpenAlexW2083336308MaRDI QIDQ1044002FDOQ1044002
Authors: 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Acyclic colorings of planar graphs
- Acyclic edge colorings of graphs
- Title not available (Why is that?)
- Acyclic colorings of subcubic graphs
- Primes in short intervals
- Optimal Acyclic Edge Colouring of Grid Like Graphs
- Acyclic Edge Colouring of Outerplanar Graphs
- The acyclic edge chromatic number of a random d‐regular graph is d + 1
- A family of perfect factorisations of complete bipartite graphs
- d‐Regular graphs of acyclic chromatic index at least d+2
Cited In (8)
- Some results on acyclic edge coloring of plane graphs
- Acyclic edge coloring of planar graphs with \(\varDelta\) colors
- Edge-colouring of graphs and hereditary graph properties.
- Improved bounds on coloring of graphs
- On acyclic edge-coloring of complete bipartite graphs
- A note on transformations of edge colorings of bipartite graphs
- On acyclic edge coloring of toroidal graphs
- On acyclic edge-coloring of the complete bipartite graphs \(K_{2p-1, 2p-1}\) for odd prime \(p\)
This page was built for publication: A note on acyclic edge coloring of complete bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044002)
