Two-factorizations of the complete graph
From MaRDI portal
Recommendations
- On the Oberwolfach problem with two similar length cycles
- On bipartite 2-factorizations of \(K_{n} - I\) and the Oberwolfach problem
- On the Hamilton-Waterloo problem
- The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors
- On factorisations of complete graphs into circulant graphs and the Oberwolfach problem
Cited in
(17)- Graphs containing every 2-factor
- Repeated edges in 2-factorizations
- Solutions to the Oberwolfach problem for orders up to 100
- The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs.
- Cycle frames and the Oberwolfach problem
- Some new results on 1-rotational 2-factorizations of the complete graph
- Pancomponented 2-factorizations of complete graphs
- Complete solutions to the Oberwolfach problem for an infinite set of orders
- Primitive 2-factorizations of the complete graph
- Note on three table Oberwolfach problem
- Merging combinatorial design and optimization: the Oberwolfach problem
- Two-factorizations of small complete graphs
- Two-factorisations of complete graphs of orders fifteen and seventeen
- Explicit 2-factorizations of the odd graph
- scientific article; zbMATH DE number 6470737 (Why is no real title available?)
- Some problems about \(r\)-factorizations of complete graphs
- On 2-factorizations of the complete graph: From thek-pyramidal to the universal property
This page was built for publication: Two-factorizations of the complete graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5421127)
