Skip to main content

Matchings and Independent Sets

  • Chapter
Theory and Application of Graphs

Part of the book series: Network Theory and Applications ((NETA,volume 10))

  • 433 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Publish with us

Policies and ethics