Skip to main content

Matchings and 1-Factors

Part of the Lecture Notes in Mathematics book series (LNM,volume 2031)

Abstract

In this chapter we consider matchings and 1-factors of graphs, and these results will frequently be used in latter chapters. Of course, they are interesting on their own, and have many applications in various areas of mathematics and computer science. The reader is referred to two books [182] by Lovász and Plummer and [254] by Yu and Liu for a more detailed treatment of matchings and 1-factors.

Keywords

  • Bipartite Graph
  • Perfect Matchings
  • Simple Graph
  • Vertex Cover
  • Maximum Match

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, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.99
Price excludes VAT (Canada)
  • Compact, lightweight 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jin Akiyama .

Rights and permissions

Reprints and Permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Akiyama, J., Kano, M. (2011). Matchings and 1-Factors. In: Factors and Factorizations of Graphs. Lecture Notes in Mathematics(), vol 2031. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21919-1_2

Download citation