Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Two-Factorizations of Small Complete Graphs II: the Case of 13 Vertices

F. Franek1, J. Holub2, A. Rosa3
1Department of Computers and Software McMaster University Hamilton, Ontario, Canada
2Department of Computers and Software McMaster University Hamilton, Ontario, Canada and Department of Computer Science and Engineering Czech Technical University Prague, Czech Republic
3Department of Mathematics and Statistics McMaster University Hamilton, Ontario, Canada
  • Published: 30/11/2004

Abstract

We establish that for each of the 5005 possible types of 2-factorizations of the complete graph \( K_{13} \), there exists at least one solution. We also enumerate all nonisomorphic solutions to the Oberwolfach problem \( \text{OP}(13;3,3,3,4) \).

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
F. Franek, J. Holub, A. Rosa. Two-Factorizations of Small Complete Graphs II: the Case of 13 Vertices[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 051. 89-94. .