On sharply vertex transitive 2-factorizations of the complete graph

DOI10.1016/j.jcta.2004.11.014zbMath1070.05066WikidataQ114162758 ScholiaQ114162758MaRDI QIDQ2566805

Marco Buratti, Gloria Rinaldi

Publication date: 28 September 2005

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

Full work available at URL: https://doi.org/10.1016/j.jcta.2004.11.014

zbMATH Keywords

factor; cycle decomposition; Oberwolfach; Hamilton-Waterloo problems

Mathematics Subject Classification ID

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

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

Related Items

On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors, A cyclic solution for an infinite class of Hamilton-Waterloo problems, Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles, The Hamilton-Waterloo problem with \(C_4\) and \(C_m\) factors, Zero-sum flows for triple systems, The structure of 2-pyramidal 2-factorizations, Primitive 2-factorizations of the complete graph, On 2-factorizations whose automorphism group acts doubly transitively on the factors, Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four vertices, Orthogonally Resolvable Cycle Decompositions, Some new results on 1-rotational 2-factorizations of the complete graph, On bipartite 2-factorizations of kn − I and the Oberwolfach problem, On 2-factorizations of the complete graph: From thek-pyramidal to the universal property, On 2-factorizations with some symmetry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cyclic one-factorization of the complete graph
• On the Hamilton-Waterloo problem
• On classifying finite edge colored graphs with two transitive automorphism groups.
• Cyclic Hamiltonian cycle systems of the complete graph.
• The Oberwolfach problem and factors of uniform odd length cycles
• Quaternionic starters
• Some constructions for cyclic perfect cycle systems
• Doubly transitive 2-factorizations
• Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
• Nilpotent 1-factorizations of the complete graph
• Abelian 1-factorizations of the complete graph