scientific article; zbMATH DE number 2148767
From MaRDI portal
Publication:4660320
The type of a 2-factor is the multiset of cycle lengths in the 2-factor. The type of a 2-factorization is the multiset of the types of its 2-factors. It is shown that for each of the 5005 possible types of 2-factorizations on 13 vertices, there exists a 2-factorization of this type. Further, it is determined that there are eight nonisomorphic 2-factorizations of \(K_{13}\) in which every 2-factor contains one 4-cycle and three 3-cycles. [For Part I see \textit{F. Franek} and \textit{A. Rosa}, J. Stat. Plann. Inference 86, 435--442 (2000; Zbl 0956.05081).]
Recommendations
Cited in
(17)- Complete solutions to the Oberwolfach problem for an infinite set of orders
- Two-factorizations of small complete 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 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
- The existence of restricted resolvable designs. I: (1,2)-factorizations of \(K_{2n}\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4660320)
