Abstract
If G is any graph, then a factor or spanning subgraph of G is a subgraph with vertex-set V (G). A factorization of G is a set of factors of G which are pairwise edge-disjoint — no two have a common edge —and whose union is all of G.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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-Factors and One-Factorizations. In: One-Factorizations. Mathematics and Its Applications, vol 390. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2564-3_3
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2564-3_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4766-6
Online ISBN: 978-1-4757-2564-3
eBook Packages: Springer Book Archive