Decomposing complete equipartite graphs into short even cycles
From MaRDI portal
Publication:3084613
DOI10.1002/jcd.20265zbMath1216.05118OpenAlexW3109803175MaRDI QIDQ3084613
Nicholas J. Cavenagh, Benjamin R. Smith
Publication date: 25 March 2011
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.20265
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Newi-Perfect Cycle Decompositions via Vertex Colorings of Graphs, Cyclic cycle systems of the complete multipartite graph, 4-cycle systems of \(K_n-E(F^\ast)\), Coloring the square of Sierpiński graphs, Decomposing Complete Equipartite Multigraphs into Cycles of Variable Lengths: The Amalgamation-detachment Approach, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decomposing complete equipartite graphs into odd square-length cycles: number of parts even
- 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
- An asymptotic solution to the cycle decomposition problem for complete graphs
- Decomposing complete equipartite graphs into short odd cycles
- Decompositions of complete multipartite graphs into cycles of even length
- \(C_{p}\)-decompositions of some regular graphs
- Cycle decompositions III: Complete graphs and fixed length cycles
- Decomposing complete equipartite graphs into odd square-length cycles: number of parts odd
- Decomposing complete equipartite graphs into cycles of length2p
- Decompositions of complete graphs into long cycles
- Cycle decompositions of complete multigraphs
