Decompositions of complete multipartite graphs into cycles of even length
From MaRDI portal
Publication:1972321
DOI10.1007/s003730050003zbMath0944.05083OpenAlexW2045908445MaRDI QIDQ1972321
Elizabeth J. Billington, Nicholas J. Cavenagh
Publication date: 26 April 2000
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003730050003
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Cycle systems in the complete bipartite graph minus a one-factor, \(C_7\)-decompositions of the tensor product of complete graphs, \(C_{p}\)-decompositions of some regular graphs, \(C_{4p}\)-frame of complete multipartite multigraphs, \(2p\)-cycle decompositions of some regular graphs and digraphs, Equipartite gregarious 6- and 8-cycle systems, Decomposing various graphs into short even-length cycles, Decomposing complete equipartite graphs into odd square-length cycles: number of parts even, Cyclic cycle systems of the complete multipartite graph, Large sets of Hamilton cycle decompositions of complete bipartite graphs, 4-cycle systems of \(K_n-E(F^\ast)\), Resolvable 4-cycle group divisible designs with two associate classes: part size even, Equipartite and almost-equipartite gregarious 4-cycle systems, Maximum cyclic 4-cycle packings of the complete multipartite graph, Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts, Decompositions of complete graphs into blown-up cycles \(C_m\)[2], Decomposing dense bipartite graphs into 4-cycles, Cycle-supermagic decompositions of complete multipartite graphs, Decomposing complete equipartite graphs into odd square-length cycles: number of parts odd, Decompositions of some regular graphs into unicyclic graphs of order five, $C_4$-decomposition of the tensor product of complete graphs, Decomposing complete tripartite graphs into closed trails of arbitrary lengths, 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, Unnamed Item, Unnamed Item, Six-cycle systems, Path and cycle decompositions of complete equipartite graphs: Four parts, Closed trail decompositions of some classes of regular graphs, Unnamed Item, Decomposing complete tripartite graphs into cycles of lengths 3 and 4, Some equitably 3-colourable cycle decompositions of complete equipartite graphs, OnH-antimagic decomposition of toroidal grids and triangulations
