Journal article
Repeated edges in 2‐factorizations
Abstract
Abstract The spectrum of numbers of repeated edges in 2‐factorizations of 2K n is determined for all n. The techniques employed are direct, using isomorphic factorizations of K n , and closely related factorizations.
Authors
Colbourn CJ; Rosa A
Journal
Journal of Graph Theory, Vol. 14, No. 1, pp. 5–24
Publisher
Wiley
Publication Date
March 1990
DOI
10.1002/jgt.3190140103
ISSN
0364-9024