On 2-factorizations of the complete graph: From thek-pyramidal to the universal property

DOI10.1002/jcd.20205zbMath1171.05039OpenAlexW2111875584WikidataQ114236280 ScholiaQ114236280MaRDI QIDQ3184590

Gloria Rinaldi, Simona Bonvicini, Giuseppe Mazzuoccolo

Publication date: 21 October 2009

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.20205

zbMATH Keywords

automorphism groupscomplete graphs2-factorizations

Mathematics Subject Classification ID

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

Related Items (9)

On the Oberwolfach problem for single-flip 2-factors via graceful labelings ⋮ Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles ⋮ On the existence of unparalleled even cycle systems ⋮ A complete solution to the two-table Oberwolfach problems ⋮ On the full automorphism group of a Hamiltonian cycle system of odd order ⋮ A constructive solution to the Oberwolfach problem with a large cycle ⋮ 2‐Starters, Graceful Labelings, and a Doubling Construction for the Oberwolfach Problem ⋮ Some Results on 1‐Rotational Hamiltonian Cycle Systems ⋮ The structure of 2-pyramidal 2-factorizations

Cites Work

• Unnamed Item
• Cyclic one-factorization of the complete graph
• On graphs with given automorphism group
• On the automorphism groups of almost all Cayley graphs
• On the groups of automorphisms of Steiner triple and quadruple systems
• Two-factorizations of small complete graphs
• The Oberwolfach problem and factors of uniform odd length cycles
• Automorphism groups of graphs and edge-contraction
• Primitive 2-factorizations of the complete graph
• On 2-factorizations whose automorphism group acts doubly transitively on the factors
• Every group is the collineation group of some projective plane
• On sharply vertex transitive 2-factorizations of the complete graph
• Doubly transitive 2-factorizations
• Hamilton cycle rich two-factorizations of complete graphs
• 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem
• Tournaments With a Given Automorphism Group
• Graphs of Degree Three with a Given Abstract Group
• Regular Oberwolfach problems and group sequencings

This page was built for publication: On 2-factorizations of the complete graph: From thek-pyramidal to the universal property