A note on acyclic edge coloring of complete bipartite graphs
From MaRDI portal
(Redirected from Publication:1044002)
Recommendations
Cites work
- scientific article; zbMATH DE number 3616457 (Why is no real title available?)
- scientific article; zbMATH DE number 1775440 (Why is no real title available?)
- scientific article; zbMATH DE number 1432797 (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
- Acyclic Edge Colouring of Outerplanar Graphs
- Acyclic colorings of planar graphs
- Acyclic colorings of subcubic graphs
- Acyclic edge colorings of graphs
- Optimal Acyclic Edge Colouring of Grid Like Graphs
- Primes in short intervals
- The acyclic edge chromatic number of a random d‐regular graph is d + 1
Cited in
(8)- Some results on acyclic edge coloring of plane graphs
- Acyclic edge coloring of planar graphs with \(\varDelta\) colors
- Edge-colouring of graphs and hereditary graph properties.
- Improved bounds on coloring of graphs
- On acyclic edge-coloring of complete bipartite graphs
- A note on transformations of edge colorings of bipartite graphs
- On acyclic edge coloring of toroidal graphs
- On acyclic edge-coloring of the complete bipartite graphs \(K_{2p-1, 2p-1}\) for odd prime \(p\)
This page was built for publication: A note on acyclic edge coloring of complete bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044002)