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 that 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
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Wallis, W.D. (2000). Factorizations. In: A Beginner’s Guide to Graph Theory. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4757-3134-7_6
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3134-7_6
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4757-3136-1
Online ISBN: 978-1-4757-3134-7
eBook Packages: Springer Book Archive