Uniformly resolvable cycle decompositions with four different factors

DOI10.1007/S00373-017-1856-6MaRDI QIDQ1696545zbMATH OpenOpenAlexFDO

Authors Uğur Odabaşı, Sibel Özkan

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

2-factorizationscycle decompositionsHamilton-Waterloo problemOberwolfach problemuniformly resolvable decompositions

Mathematics Subject Classification ID

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

Recommendations

• A note on uniformly resolvable decompositions of \(K_v\) and \(K_v-I\) into 2-stars and 4-cycles
• scientific article; zbMATH DE number 7641237
• Factorizations of complete graphs into cycles and 1-factors
• Uniformly resolvable decompositions of \(K_v\) in 1-factors and 4-stars
• Uniform decompositions of complete multigraphs into cycles

Cites work

• A cyclic solution for an infinite class of Hamilton-Waterloo problems
• A note on uniformly resolvable decompositions of \(K_v\) and \(K_v-I\) into 2-stars and 4-cycles
• Graph theory
• scientific article; zbMATH DE number 3922695 (Why is no real title available?)
• scientific article; zbMATH DE number 3596859 (Why is no real title available?)
• Maximum uniformly resolvable decompositions of \(K_v\) and \(K_v - I\) into 3-stars and 3-cycles
• On a generalization of the Oberwolfach problem
• On sharply vertex transitive 2-factorizations of the complete graph
• On the existence of uniformly resolvable decompositions of K_v and K_v-I into paths and kites
• On the Hamilton-Waterloo problem
• On the Hamilton-Waterloo problem for bipartite 2-factors
• Resolvable group divisible designs with block size 3
• The equipartite Oberwolfach problem with uniform tables
• The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
• The Hamilton-Waterloo Problem for C3-Factors and Cn-Factors
• The Hamilton-Waterloo problem for cycle sizes 3 and 4
• The Hamilton-Waterloo problem for two even cycles factors
• The Hamilton-Waterloo problem with 4-cycles and a single factor of \(n\)-cycles
• The Hamilton-Waterloo problem with \(C_4\) and \(C_m\) factors
• The Hamilton-Waterloo problem with triangle-factors and Hamilton cycles: the case \(n\equiv 3\pmod{18}\)
• The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors
• The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle
• The Oberwolfach problem and factors of uniform odd length cycles
• The solution of the bipartite analogue of the Oberwolfach problem
• Two new direct product‐type constructions for resolvable group‐divisible designs
• Uniformly resolvable \(\mathcal H\)-designs with \(\mathcal H=\{P_3,P_4\}\)
• Uniformly resolvable decompositions of K_v into P₃ and K₃ graphs
• Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four vertices

Cited in

(6)

• 4-cycle decompositions of \((\lambda +m)K_{v+u} {\setminus } \lambda K_v\)
• Factorizations of complete graphs into cycles and 1-factors
• Uniform decompositions of complete multigraphs into cycles
• Uniformly resolvable decompositions of \(K_v\) in 1-factors and 4-stars
• On the generalized Oberwolfach problem
• A survey on constructive methods for the Oberwolfach problem and its variants

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1696545)