Abstract
Central to the content of this chapter is to consider two special classes of subsets in a graph, that is, matchings and independent sets.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Xu, J. (2003). Matchings and Independent Sets. In: Theory and Application of Graphs. Network Theory and Applications, vol 10. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-8698-6_5
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8698-6_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4670-8
Online ISBN: 978-1-4419-8698-6
eBook Packages: Springer Book Archive