Home
Scholarly Works
Repeated edges in 2‐factorizations
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

January 1, 1990

DOI

10.1002/jgt.3190140103

ISSN

0364-9024

Associated Experts

Alexander Rosa

Professor Emeritus, Mathematics and Statistics
Visit profile

Labels

Fields of Research (FoR)

4904 Pure Mathematics49 Mathematical Sciences4604 Cybersecurity and privacy4613 Theory of computation4901 Applied mathematics
View published work (Non-McMaster Users)

Contact the Experts team

Get technical help
or
Provide website feedback
Repeated edges in 2‐factorizations