The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs
A pancyclic 2-factorization of an \(n\)-vertex graph \(G\) is a 2-factorization of \(G\) such that for each \(k= 3,4,\dots, n-4,n-3,n\), a cycle of length \(k\) is contained in at least one 2-factor. It is shown that a pancyclic 2-factorization of the complete graph \(K_{2n+1}\) exists for all \(n\geq 1\). Pancyclic 2-factorizations of the cocktail-party graph \(K_{2n}-I\) (where \(I\) is a 1-factor), of the complete bipartite graph \(K_{2n,2n}\), and of the graph \(K_{2n+1, 2n+1}- I\) are also discussed. For the entire collection see [Zbl 0935.00049].
- The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs.
- The directed anti-Oberwolfach solution: Pancyclic 2-factorizations of complete directed graphs of odd order
- SOME RESULTS ON THE OBERWOLFACH PROBLEM
- Hamilton cycle rich two-factorizations of complete graphs
- On the Oberwolfach problem with two similar length cycles
- The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs.
- Pancomponented 2-factorizations of complete graphs
- scientific article; zbMATH DE number 1394637 (Why is no real title available?)
- The directed anti-Oberwolfach solution: Pancyclic 2-factorizations of complete directed graphs of odd order
This page was built for publication: The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4508368)
