The anti-Oberwolfach solution: pancyclic 2-factorizations of complete graphs

Brett Stevens. The anti-Oberwolfach solution: pancyclic 2-factorizations of complete graphs. Theoretical Computer Science, 297(1-3):399-424, 2003. [doi]

@article{Stevens03:2,
  title = {The anti-Oberwolfach solution: pancyclic 2-factorizations of complete graphs},
  author = {Brett Stevens},
  year = {2003},
  doi = {10.1016/S0304-3975(02)00650-3},
  url = {http://dx.doi.org/10.1016/S0304-3975(02)00650-3},
  tags = {completeness, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Stevens03%3A2},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {297},
  number = {1-3},
  pages = {399-424},
}