The equipartite Oberwolfach problem with uniform tables

DOI10.1016/S0097-3165(02)00011-0zbMath1015.05074MaRDI QIDQ1865407

Jiuqiang Liu

Publication date: 26 March 2003

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

zbMATH Keywords

cycle; factorization; factor; complete multipartite graph; Oberwolfach problem

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05B40: Combinatorial aspects of packing and covering

Related Items

Unnamed Item, Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem, On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors, Unnamed Item, Bipartite 2‐Factorizations of Complete Multipartite Graphs, Decompositions of complete symmetric directed graphs into the oriented heptagons, On the generalized Oberwolfach problem, On the Hamilton-Waterloo problem: the case of two cycles sizes of different parity, The Hamilton-Waterloo problem for triangle-factors and heptagon-factors, On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles, A cyclic solution for an infinite class of Hamilton-Waterloo problems, Ascending subgraph decompositions in oriented complete balanced tripartite graphs, On the directed Oberwolfach problem with equal cycle lengths, Decomposing complete equipartite graphs into odd square-length cycles: number of parts even, On the existence of holey 4-cycle frames, The Hamilton-Waterloo problem with \(C_4\) and \(C_m\) factors, On the existence of cycle frames and almost resolvable cycle systems, More results on cycle frames and almost resolvable cycle systems, Almost resolvable maximum packings of complete graphs with 5-cycles, Path and cycle decompositions of complete equipartite graphs: Four parts, Uniformly resolvable cycle decompositions with four different factors, Completing the spectrum of almost resolvable cycle systems with odd cycle length, On the Hamilton-Waterloo problem with cycle lengths of distinct parities, Cyclic uniform 2-factorizations of the complete multipartite graph, On a generalization of the Oberwolfach problem, Six-cycle systems, Ascending subgraph decompositions of oriented graphs that factor into triangles, Resolvable even cycle decompositions of the tensor product of complete graphs, The Hamilton-Waterloo problem with even cycle lengths, \(C_{p}\)-decompositions of some regular graphs, A note on the Hamilton-Waterloo problem with \(C_8\)-factors and \(C_m\)-factors, Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four vertices, The Hamilton-Waterloo problem with 4-cycles and a single factor of \(n\)-cycles, A greedy algorithm for the social golfer and the Oberwolfach problem, Orthogonally Resolvable Cycle Decompositions, Decomposing complete equipartite graphs into short even cycles, Factorizations of complete graphs into cycles and 1-factors, Closed trail decompositions of complete equipartite graphs, Decomposing complete tripartite graphs into closed trails of arbitrary lengths

Cites Work

• Unnamed Item
• Unnamed Item
• Frames for Kirkman triple systems
• On a variation of the Oberwolfach problem
• Hamiltonian decomposition of lexicographic product
• The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
• The solution of the bipartite analogue of the Oberwolfach problem
• The Oberwolfach problem and factors of uniform odd length cycles
• Two new direct product‐type constructions for resolvable group‐divisible designs