Decomposing complete equipartite graphs into odd square-length cycles: number of parts even
From MaRDI portal
Publication:418858
DOI10.1016/j.disc.2012.02.010zbMath1242.05224OpenAlexW2082573105WikidataQ114190757 ScholiaQ114190757MaRDI QIDQ418858
Nicholas J. Cavenagh, Benjamin R. Smith
Publication date: 30 May 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.02.010
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (3)
Cyclic cycle systems of the complete multipartite graph ⋮ Decomposing complete equipartite graphs into odd square-length cycles: number of parts odd ⋮ Decomposing complete equipartite graphs into short even cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts
- Path and cycle decompositions of complete equipartite graphs: Four parts
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- The equipartite Oberwolfach problem with uniform tables
- Decompositions of complete multipartite graphs into cycles of even length
- \(C_{p}\)-decompositions of some regular graphs
- Packing Circuits into KN
- Cycle decompositions III: Complete graphs and fixed length cycles
- Decomposing complete equipartite graphs into cycles of length2p
This page was built for publication: Decomposing complete equipartite graphs into odd square-length cycles: number of parts even