Two-factorizations of small complete graphs

DOI10.1016/S0378-3758(99)00123-8zbMATH Open0956.05081WikidataQ114120968 ScholiaQ114120968MaRDI QIDQ1569867FDOQ1569867

Authors: Frantisek Franek, Alexander Rosa 

Publication date: 9 July 2000

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

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

zbMATH Keywords

two-factorizationtwo-factor

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Maximal sets of 2-factors and Hamiltonian cycles
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (22)

• On the Hamilton-Waterloo problem for bipartite 2-factors
• Resolvable cycle decompositions of complete multigraphs and complete equipartite multigraphs via layering and detachment
• On oriented 2-factorable graphs
• The Oberwolfach problem with loving couples
• Hamilton cycle rich 2-factorizations of complete multipartite graphs
• Title not available (Why is that?)
• A cyclic solution for an infinite class of Hamilton-Waterloo problems
• Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles
• Complete solutions to the Oberwolfach problem for an infinite set of orders
• A survey on constructive methods for the Oberwolfach problem and its variants
• Title not available (Why is that?)
• Primitive 2-factorizations of the complete graph
• On the generalized Oberwolfach problem
• On bipartite 2-factorizations of \(K_{n} - I\) and the Oberwolfach problem
• Combinatorial properties of strength groups in round robin tournaments
• Two-factorisations of complete graphs of orders fifteen and seventeen
• On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles
• The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors
• Scheduling sports tournaments on a single court minimizing waiting times
• Title not available (Why is that?)
• On a generalization of the Oberwolfach problem
• On 2-factorizations of the complete graph: From thek-pyramidal to the universal property

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)