Decomposing complete equipartite graphs into cycles of length2p
From MaRDI portal
Publication:3503600
DOI10.1002/jcd.20173zbMath1149.05026MaRDI QIDQ3503600
Publication date: 5 June 2008
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.20173
05C38: Paths and cycles
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Block colourings of 6-cycle systems, Unnamed Item, $C_4$-decomposition of the tensor product of complete graphs, Unnamed Item, Decomposition of complete tripartite graphs into cycles and paths of length three, Unnamed Item, Unnamed Item, Cyclic cycle systems of the complete multipartite graph, Decomposing complete equipartite graphs into odd square-length cycles: number of parts even, Decomposing certain equipartite graphs into sunlet graphs of length \(2p\), Decomposing complete equipartite graphs into closed trails of length \(k\), Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts, Path and cycle decompositions of complete equipartite graphs: Four parts, \(2p\)-cycle decompositions of some regular graphs and digraphs, Sunlet decomposition of certain equipartite graphs, Pack graphs with subgraphs of size three, Decompositions of some classes of dense graphs into cycles of lengths 4 and 8, Six-cycle systems, Decomposition of complete equipartite graphs into paths and cycles of length \(2p\), Resolvable even cycle decompositions of the tensor product of complete graphs, \(C_7\)-decompositions of the tensor product of complete graphs, \(C_{4p}\)-frame of complete multipartite multigraphs, Decomposing Complete Equipartite Multigraphs into Cycles of Variable Lengths: The Amalgamation-detachment Approach, Decomposing complete equipartite graphs into odd square-length cycles: number of parts odd, Decomposing complete equipartite graphs into short even cycles, Closed trail decompositions of complete equipartite graphs
