Abstract
The complete multigraph λK v has v vertices and there are λ edges joining each pair of vertices. One-factors and one-factorizations of λK v are defined in the obvious way; if v is odd there can be no one-factor, and when v is even, say v = 2n, one can produce a one-factorization of λK 2n by taking λ copies of each factor in a one-factorization of K 2n .
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Wallis, W.D. (1997). One-Factorizations of Multigraphs. In: One-Factorizations. Mathematics and Its Applications, vol 390. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2564-3_17
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2564-3_17
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4766-6
Online ISBN: 978-1-4757-2564-3
eBook Packages: Springer Book Archive