On acyclic edge-coloring of the complete bipartite graphs \(K_{2p-1, 2p-1}\) for odd prime \(p\)

DOI10.1016/j.disc.2015.07.010zbMath1322.05063OpenAlexW1456357822MaRDI QIDQ501029

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

zbMATH Keywords

perfect matchingcomplete bipartite graphsacyclic chromatic indexacyclic edge-coloringperfect 1-factorization

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Local conditions for planar graphs of acyclic edge coloring ⋮ On acyclic edge-coloring of complete bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved bounds on coloring of graphs
• On perfect one-factorization of the complete graph \(K_{2p}\)
• A note on acyclic edge coloring of complete bipartite 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
• Acyclic colorings of planar graphs

This page was built for publication: On acyclic edge-coloring of the complete bipartite graphs \(K_{2p-1, 2p-1}\) for odd prime \(p\)