Uniformly resolvable cycle decompositions with four different factors

DOI10.1007/s00373-017-1856-6zbMath1380.05110OpenAlexW2765121444MaRDI QIDQ1696545

Sibel Özkan, Uğur Odabaşı

Publication date: 14 February 2018

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-017-1856-6

zbMATH Keywords

cycle decompositionsHamilton-Waterloo problemOberwolfach problem2-factorizationsuniformly resolvable decompositions

Mathematics Subject Classification ID

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

Related Items (1)

On the generalized Oberwolfach problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A cyclic solution for an infinite class of Hamilton-Waterloo problems
• On the existence of uniformly resolvable decompositions of \(K_v\) and \(K_v-I\) into paths and kites
• Uniformly resolvable decompositions of \(K_v\) into \(P_3\) and \(K_3\) graphs
• The Hamilton-Waterloo problem with \(C_4\) and \(C_m\) factors
• Resolvable group divisible designs with block size 3
• The Hamilton-Waterloo problem for two even cycles factors
• The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
• The solution of the bipartite analogue of the Oberwolfach problem
• On the Hamilton-Waterloo problem
• The Oberwolfach problem and factors of uniform odd length cycles
• On a generalization of the Oberwolfach problem
• The equipartite Oberwolfach problem with uniform tables
• The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors
• Maximum uniformly resolvable decompositions of \(K_v\) and \(K_v - I\) into 3-stars and 3-cycles
• Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four vertices
• On sharply vertex transitive 2-factorizations of the complete graph
• The Hamilton-Waterloo problem with 4-cycles and a single factor of \(n\)-cycles
• The Hamilton-Waterloo problem for cycle sizes 3 and 4
• The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle
• The Hamilton-Waterloo Problem for C3-Factors and Cn-Factors
• Two new direct product‐type constructions for resolvable group‐divisible designs
• On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors

This page was built for publication: Uniformly resolvable cycle decompositions with four different factors