On acyclic edge-coloring of complete bipartite graphs
From MaRDI portal
Publication:729782
DOI10.1016/j.disc.2016.08.026zbMath1351.05090arXiv1503.03283OpenAlexW1643754303MaRDI QIDQ729782
Sai Mali Ananthanarayanan, Ayineedi Venkateswarlu, Santanu Sarkar
Publication date: 22 December 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.03283
perfect matchingcomplete bipartite graphsacyclic chromatic indexacyclic edge-coloringperfect 1-factorization
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved bounds on coloring of graphs
- On acyclic edge-coloring of the complete bipartite graphs \(K_{2p-1, 2p-1}\) for odd prime \(p\)
- Acyclic edge coloring through the Lovász local lemma
- A note on acyclic edge coloring of complete bipartite graphs
- Transversals of latin squares and their generalizations
- A family of perfect factorisations of complete bipartite graphs
- Acyclic edge-coloring using entropy compression
- Acyclic edge colorings of graphs
- On a Generalization of the Ryser-Brualdi-Stein Conjecture
- Optimal Acyclic Edge Colouring of Grid Like Graphs
- Acyclic coloring of graphs
- Optimal acyclic edge‐coloring of cubic 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
