Abstract
If G is any graph, then afactor or spanning subgraph of G is a subgraph with vertexset 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.
This is a preview of subscription content, log in via an institution to check access.
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
© 2007 Second Edition, Birkhäuser Boston
About this chapter
Cite this chapter
Wallis, W.D. (2007). Factorizations. In: A Beginner’s Guide to Graph Theory. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4580-9_6
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4580-9_6
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-4484-0
Online ISBN: 978-0-8176-4580-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)