Matchings and 1-Factors

  • Jin AkiyamaEmail author
  • Mikio Kano
Part of the Lecture Notes in Mathematics book series (LNM, volume 2031)


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.


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  1. 1.Research Institute of Educational DevelopmentTokai UniversityTokyoJapan
  2. 2.Computer and Information SciencesIbaraki UniversityHitachiJapan

Personalised recommendations