Some equitably 3-colorable cycle decompositions of K_v + 1
From MaRDI portal
Publication:409404
DOI10.1016/J.DISC.2011.08.016zbMATH Open1238.05094OpenAlexW2093288360MaRDI QIDQ409404FDOQ409404
Authors: Shanhai Li, Jun Ma 
Publication date: 13 April 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.08.016
Recommendations
Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Graph designs and isomorphic decomposition (05C51)
Cites Work
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Cycle decompositions. III: Complete graphs and fixed length cycles.
- Title not available (Why is that?)
- Some equitably 3-colourable cycle decompositions
- Some equitably 3-colourable cycle decompositions of complete equipartite graphs
- Some equitably 2-colourable cycle decompositions.
- Title not available (Why is that?)
- Decomposition of the complete graph plus a 1‐factor into cycles of equal length
Cited In (6)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some equitably 2-colourable cycle decompositions.
- Some equitably 3-colourable cycle decompositions
- Some equitably 3-colourable cycle decompositions of complete equipartite graphs
- Some equitably 2-colourable cycle decompositions of multipartite graphs
This page was built for publication: Some equitably 3-colorable cycle decompositions of \(K_v + 1\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409404)
