Two-factorizations of small complete graphs
A 2-factor is a spanning 2-regular subgraph and a 2-factorization is a partition of the edge set into 2-factors. The type of a 2-factor of an \(n\)-vertex graph \(G\) is a partition of \(n\) into parts no less than 3. The type of a 2-factorization is a list of the types of the 2-factors in it, presented in nondecreasing order, assuming an order on the types of the 2-factors. This paper enumerates all 2-factorizations classified by type for the complete graph on nine vertices, and for 2-factorizations of selected types of the complete graph on 11 vertices.
- scientific article; zbMATH DE number 4025450 (Why is no real title available?)
- scientific article; zbMATH DE number 3792207 (Why is no real title available?)
- scientific article; zbMATH DE number 637270 (Why is no real title available?)
- scientific article; zbMATH DE number 874528 (Why is no real title available?)
- scientific article; zbMATH DE number 3392464 (Why is no real title available?)
- scientific article; zbMATH DE number 3020563 (Why is no real title available?)
- Maximal sets of 2-factors and Hamiltonian cycles
- Scheduling sports tournaments on a single court minimizing waiting times
- Combinatorial properties of strength groups in round robin tournaments
- Complete solutions to the Oberwolfach problem for an infinite set of orders
- On oriented 2-factorable graphs
- On a generalization of the Oberwolfach problem
- The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors
- Primitive 2-factorizations of the complete graph
- Hamilton cycle rich 2-factorizations of complete multipartite graphs
- A cyclic solution for an infinite class of Hamilton-Waterloo problems
- Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles
- On bipartite 2-factorizations of \(K_{n} - I\) and the Oberwolfach problem
- On 2-factorizations of the complete graph: From thek-pyramidal to the universal property
- scientific article; zbMATH DE number 718669 (Why is no real title available?)
- scientific article; zbMATH DE number 1556749 (Why is no real title available?)
- scientific article; zbMATH DE number 2148767 (Why is no real title available?)
- On the Hamilton-Waterloo problem for bipartite 2-factors
- On the generalized Oberwolfach problem
- Two-factorisations of complete graphs of orders fifteen and seventeen
- On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles
- Resolvable cycle decompositions of complete multigraphs and complete equipartite multigraphs via layering and detachment
- The Oberwolfach problem with loving couples
- A survey on constructive methods for the Oberwolfach problem and its variants
- Completing the solution of the directed Oberwolfach problem with two tables
- A solution to small cases of the honeymoon Oberwolfach problem
- The directed Oberwolfach problem with variable cycle lengths: a recursive construction
- Transforming solutions for the Oberwolfach problem into solutions for the spouse-loving variant
- On Kotzig's perfect set problem of Hamiltonian cycle decompositions of the complete graph
This page was built for publication: Two-factorizations of small complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569867)
