Abstract
The spectrum of numbers of repeated edges in 2‐factorizations of 2Kn is determined for all n. The techniques employed are direct, using isomorphic factorizations of Kn, and closely related factorizations.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 5-24 |
| Number of pages | 20 |
| Journal | Journal of Graph Theory |
| Volume | 14 |
| Issue number | 1 |
| DOIs | |
| State | Published - Mar 1990 |
| Externally published | Yes |
ASJC Scopus subject areas
- Geometry and Topology