Abstract
If W is any subset of the vertex-set V (G) of a graph or multigraph G, we write G — W to denote the graph constructed by deleting from G all vertices in W and all edges touching then. One can discuss the components of G — W; they are either odd (have an odd number of vertices) or even. Let Φ G (W) denote the number of odd components of G — W.
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
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Wallis, W.D. (1997). A General Existence Theorem. In: One-Factorizations. Mathematics and Its Applications, vol 390. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2564-3_6
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2564-3_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4766-6
Online ISBN: 978-1-4757-2564-3
eBook Packages: Springer Book Archive