Two-factorizations of Small Complete Graphs Ii : the Case of 13 Vertices

@inproceedings{Franek2003TwofactorizationsOS,
  title={Two-factorizations of Small Complete Graphs Ii : the Case of 13 Vertices},
  author={Frantisek Franek and Jan Holub and Alexander Rosa},
  year={2003}
}
We establish that for each of the 5005 possible types of 2factorizations of the complete graph K13, there exists at least one solution. We also enumerate all nonisomorphic solutions to the Oberwolfach problem 

From This Paper

Topics from this paper.
7 Citations
4 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Two-factorizations of small complete graphs

  • F. Franek, A. Rosa
  • J. Statist. Plan. Infer
  • 2000
3 Excerpts

The Oberwolfach problem, The CRC Handbook of Combinatorial Designs (Ed.C.J.Colbourn, J.H.Dinitz)

  • B. Alspach
  • CRC Press,
  • 1996
1 Excerpt

Untersuchungen über das Oberwolfacher Problem, Arbeitspapier

  • W. Piotrowski
  • 1979
1 Excerpt

Similar Papers

Loading similar papers…