Wanless, Ian; Ihrig, Edwin C
A 1-factorization of a graph is a decomposition of the graph into edge disjoint perfect matchings. There is a well-known method, which we call the double struck K sign-construction, for building a 1-factorization of Kn,n from a 1-factorization of Kn+1. The 1-factorization of Kn,n can be written as a latin square of order n. The double struck K sign-construction has been used, among other things, to make perfect 1-factorizations, subsquare-free latin squares, and atomic latin squares. This paper...[Show more]
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.