The structure of 2-pyramidal 2-factorizations
From MaRDI portal
Recommendations
- On 2-factorizations of the complete graph: From thek-pyramidal to the universal property
- k-pyramidal one-factorizations
- On 2-factorizations whose automorphism group acts doubly transitively on the factors
- On 2-factorizations with some symmetry
- The existence of restricted resolvable designs. I: (1,2)-factorizations of \(K_{2n}\)
Cites work
- scientific article; zbMATH DE number 3922695 (Why is no real title available?)
- scientific article; zbMATH DE number 3294681 (Why is no real title available?)
- 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem
- 2-starters, graceful labelings, and a doubling construction for the Oberwolfach problem
- A complete solution to the two-table Oberwolfach problems
- A non-existence result on cyclic cycle-decompositions of the cocktail party graph
- Complete solutions to the Oberwolfach problem for an infinite set of orders
- Cyclic Hamiltonian cycle systems of the complete graph.
- Dihedral Hamiltonian cycle systems of the cocktail party graph
- Every finite solvable group with a unique element of order two, except the quaternion group, has a symmetric sequencing
- Explicit constructions for 1-rotational Kirkman triple systems
- From graceful labellings of paths to cyclic solutions of the Oberwolfach problem
- Graph products and new solutions to Oberwolfach problems
- Hamiltonian cycle systems which are both cyclic and symmetric
- On 2-factorizations of the complete graph: From thek-pyramidal to the universal property
- On a variation of the Oberwolfach problem
- On bipartite 2-factorizations of \(K_{n} - I\) and the Oberwolfach problem
- On sharply vertex transitive 2-factorizations of the complete graph
- On twizzler, zigzag and graceful terraces
- Regular Oberwolfach problems and group sequencings
- Sectionable terraces and the (generalised) Oberwolfach problem
- Some constructions for cyclic perfect cycle systems
- Some cyclic solutions to the three table Oberwolfach problem
- Some new results on 1-rotational 2-factorizations of the complete graph
- Some results on 1-rotational Hamiltonian cycle systems
- Symmetric Hamilton cycle decompositions of complete graphs minus a 1-factor
- \(G\)-invariantly resolvable Steiner 2-designs which are 1-rotational over \(G\)
- \(\phi\)-symmetric Hamilton cycle decompositions of graphs
Cited in
(7)- On the Oberwolfach problem for single-flip 2-factors via graceful labelings
- The Oberwolfach problem with loving couples
- Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles
- A survey on constructive methods for the Oberwolfach problem and its variants
- On the existence of unparalleled even cycle systems
- Merging combinatorial design and optimization: the Oberwolfach problem
- A constructive solution to the Oberwolfach problem with a large cycle
This page was built for publication: The structure of 2-pyramidal 2-factorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2345518)