Affordable Access

Publisher Website

Some Perfect One-Factorizations of K14

Authors
Identifiers
DOI: 10.1016/s0304-0208(08)72908-6
Disciplines
  • Computer Science

Abstract

Abstract We use orderly algorithms to generate 16 new perfect one-factorizations of K14. This provides a lower bound of 20 nonisomorphic perfect one-factorizations of K14 (the previous bound was 4).

There are no comments yet on this publication. Be the first to share your thoughts.