Pancomponented 2-factorizations of complete graphs

DOI10.1016/J.DISC.2004.09.014MaRDI QIDQ2568477zbMATH OpenOpenAlexWikidataFDO

Authors Brett Stevens, Dalibor Fronček

Publication date 10 October 2005

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2004.09.014

zbMATH Keywords

cycle decompositionOberwolfach problem

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs.
• scientific article; zbMATH DE number 1512681
• Hamilton cycle rich 2-factorization of complete equipartite graphs. II
• The spectrum of 4-cycles in 2-factorizations of \(K_{n,n}\).
• Two-factorizations of the complete graph

Cites work

• A generalization of the Oberwolfach problem
• Even cycle decompositions of complete graphs minus a 1‐factor
• scientific article; zbMATH DE number 867473 (Why is no real title available?)
• On a generalization of the Oberwolfach problem
• Some observations on the oberwolfach problem
• 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
• The Oberwolfach problem and factors of uniform odd length cycles
• The solution of the bipartite analogue of the Oberwolfach problem

Cited in

(2)

• The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs.
• Primitive 2-factorizations of the complete graph

This page was built for publication: Pancomponented 2-factorizations of complete graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2568477)