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
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
Corresponding author
Rights 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
DOI: https://doi.org/10.1007/978-3-642-21919-1_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21918-4
Online ISBN: 978-3-642-21919-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)
