d‐Regular graphs of acyclic chromatic index at least d+2

DOI10.1002/jgt.20422zbMath1215.05053arXiv0804.4681OpenAlexW2951648952MaRDI QIDQ5190332

L. Sunil Chandran, Manu Basavaraju, Manoj Kummini

Publication date: 15 March 2010

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0804.4681

zbMATH Keywords

matchingcomplete bipartite graphsacyclic edge coloringperfect 1-factorizationacyclic edge chromatic index

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

On acyclic edge-coloring of the complete bipartite graphs \(K_{2p-1, 2p-1}\) for odd prime \(p\) ⋮ Acyclic List Edge Coloring of Graphs ⋮ On acyclic edge-coloring of complete bipartite graphs ⋮ Acyclic edge coloring of graphs with maximum degree 4 ⋮ Acyclic edge coloring of 2-degenerate graphs ⋮ A note on acyclic edge coloring of complete bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A family of perfect factorisations of complete bipartite graphs
• Acyclic edge colorings of graphs
• Acyclic coloring of graphs
• Acyclic colorings of planar graphs

This page was built for publication: d‐Regular graphs of acyclic chromatic index at least d+2