On acyclic edge-coloring of the complete bipartite graphs K₂p-1, 2p-1 for odd prime p
From MaRDI portal
Publication:501029
DOI10.1016/J.DISC.2015.07.010zbMATH Open1322.05063OpenAlexW1456357822MaRDI QIDQ501029FDOQ501029
Authors: Ayineedi Venkateswarlu, Santanu Sarkar 
Publication date: 8 October 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2015.07.010
Recommendations
perfect matchingcomplete bipartite graphsacyclic chromatic indexacyclic edge-coloringperfect 1-factorization
Cites Work
- Title not available (Why is that?)
- Acyclic colorings of planar graphs
- Acyclic edge colorings of graphs
- Title not available (Why is that?)
- Improved bounds on coloring of graphs
- A note on acyclic edge coloring of complete bipartite graphs
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- d‐Regular graphs of acyclic chromatic index at least d+2
- On perfect one-factorization of the complete graph \(K_{2p}\)
Cited In (3)
This page was built for publication: On acyclic edge-coloring of the complete bipartite graphs \(K_{2p-1, 2p-1}\) for odd prime \(p\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q501029)
