Some results on the Oberwolfach problem. (Decomposition of complete graphs into isomorphic quadratic factors.)

DOI10.1007/BF01834032zbMath0297.05141MaRDI QIDQ1213889

Pavol Hell, Anton Kotzig, Alexander Rosa

Publication date: 1975

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/136475

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items

On a variation of the Oberwolfach problem, A brief review on Egmont Köhler's mathematical work, The thickness and chromatic number of \(r\)-inflated graphs, Sectionable terraces and the (generalised) Oberwolfach problem, The Oberwolfach problem and factors of uniform odd length cycles, Almost resolvable decompositions of \(2K_ n\) into cycles of odd length, Graph decompositions, handcuffed prisoners and balanced p-designs, From graceful labellings of paths to cyclic solutions of the Oberwolfach problem

Cites Work

• Graph decompositions, handcuffed prisoners and balanced p-designs
• Unnamed Item