scientific article; zbMATH DE number 3950583

MaRDI QIDQ3720643zbMATHFDO

Authors J. D. Horton, Bimal Roy, Paul J. Schellenberg, D. R. Stinson

Publication date 1985

zbMATH Keywords

cycles2-factorcomplete graphcomplete tripartite graphKirkman triple systemsspouse-avoiding Oberwolfach problem

Mathematics Subject Classification ID

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

Recommendations

• The solution of the bipartite analogue of the Oberwolfach problem
• On the Oberwolfach problem with two similar length cycles
• A generalization of the Oberwolfach problem
• On the spouse-loving variant of the Oberwolfach problem
• scientific article; zbMATH DE number 3922695

Cited in

(12)

• \(C_{4p}\)-frame of complete multipartite multigraphs
• On the spouse-loving variant of the Oberwolfach problem
• Factorizations of product graphs into cycles of uniform length
• A generalization of the Oberwolfach problem
• Some observations on the oberwolfach problem
• \(G\)-designs and related designs
• scientific article; zbMATH DE number 7593862 (Why is no real title available?)
• Almost resolvable decompositions of \(2K_ n\) into cycles of odd length
• The Oberwolfach problem and factors of uniform odd length cycles
• Cycle frames of complete multipartite multigraphs. III
• \(C_ k\)-factorization of complete bipartite graphs
• Near 2-factorizations of \(2K_ n:\) Cycles of even length

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