Some new results on 1-rotational 2-factorizations of the complete graph

DOI10.1002/jcd.20241zbMath1218.05154OpenAlexW1966442544WikidataQ114236279 ScholiaQ114236279MaRDI QIDQ3057071

Tommaso Traetta

Publication date: 24 November 2010

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

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

zbMATH Keywords

permutation groupcomplete graph1-rotational 2-factorization

Mathematics Subject Classification ID

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

Related Items (6)

On the Oberwolfach problem for single-flip 2-factors via graceful labelings ⋮ On the existence of unparalleled even cycle systems ⋮ A complete solution to the two-table Oberwolfach problems ⋮ A complete solution to the infinite Oberwolfach problem ⋮ 2‐Starters, Graceful Labelings, and a Doubling Construction for the Oberwolfach Problem ⋮ The structure of 2-pyramidal 2-factorizations

Cites Work

• Unnamed Item
• Round-dance neighbour designs from terraces
• On sharply vertex transitive 2-factorizations of the complete graph
• Doubly transitive 2-factorizations
• Minimal Edge-Colourings of Complete Graphs
• Every finite solvable group with a unique element of order two, except the quaternion group, has a symmetric sequencing
• 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem

This page was built for publication: Some new results on 1-rotational 2-factorizations of the complete graph