On acyclic edge-coloring of the complete bipartite graphs K₂p-1, 2p-1 for odd prime p
From MaRDI portal
Publication:501029
Recommendations
Cites work
- scientific article; zbMATH DE number 90562 (Why is no real title available?)
- scientific article; zbMATH DE number 3603300 (Why is no real title available?)
- scientific article; zbMATH DE number 3616457 (Why is no real title available?)
- scientific article; zbMATH DE number 3801586 (Why is no real title available?)
- d‐Regular graphs of acyclic chromatic index at least d+2
- A family of perfect factorisations of complete bipartite graphs
- A note on acyclic edge coloring of complete bipartite graphs
- Acyclic Edge Colouring of Outerplanar Graphs
- Acyclic colorings of planar graphs
- Acyclic edge colorings of graphs
- Improved bounds on coloring of graphs
- On perfect one-factorization of the complete graph \(K_{2p}\)
- Optimal Acyclic Edge Colouring of Grid Like Graphs
- The acyclic edge chromatic number of a random d‐regular graph is d + 1
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)