Two-factorizations of small complete graphs

DOI10.1016/S0378-3758(99)00123-8MaRDI QIDQ1569867zbMATH OpenWikidataFDO

Authors Frantisek Franek, Alexander Rosa

Publication date 9 July 2000

Published in Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0378-3758(99)00123-8

zbMATH Keywords

two-factortwo-factorization

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2148767
• Two-factorisations of complete graphs of orders fifteen and seventeen
• Two-factorizations of the complete graph
• Bipartite 2-factorizations of complete multipartite graphs
• scientific article; zbMATH DE number 1556749

Cites work

• 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

Cited in

(27)

• 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)