Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts
From MaRDI portal
Publication:960919
DOI10.1016/j.disc.2008.09.003zbMath1200.05135OpenAlexW4231988724MaRDI QIDQ960919
Nicholas J. Cavenagh, Elizabeth J. Billington, Benjamin R. Smith
Publication date: 29 March 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.09.003
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph designs and isomorphic decomposition (05C51)
Related Items
\(C_{4p}\)-frame of complete multipartite multigraphs, Decomposing complete equipartite graphs into closed trails of length \(k\), Decomposing complete equipartite graphs into odd square-length cycles: number of parts even, Cyclic cycle systems of the complete multipartite graph, Pack graphs with subgraphs of size three, Decomposing complete equipartite graphs into odd square-length cycles: number of parts odd, Decomposing Complete Equipartite Multigraphs into Cycles of Variable Lengths: The Amalgamation-detachment Approach, Decompositions of some classes of dense graphs into cycles of lengths 4 and 8, Decomposing complete equipartite graphs into short even cycles, Decomposition of complete tripartite graphs into cycles and paths of length three, Path and cycle decompositions of complete equipartite graphs: Four parts, Unnamed Item, Decomposition of complete equipartite graphs into paths and cycles of length \(2p\)
Cites Work
- Path and cycle decompositions of complete equipartite graphs: Four parts
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- 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 cycles of length2p
- Unnamed Item
