Abstract
A matching of a graph X is a collection of edges of X which are pairwise disjoint. The vertices incident to the edges of a matching M are saturated by M. A perfect matching is a matching that saturates all the vertices of X.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2009 Hindustan Book Agency
About this chapter
Cite this chapter
Cioabă, S.M., Murty, M.R. (2009). Matching Theory. In: A First Course in Graph Theory and Combinatorics. Texts and Readings in Mathematics, vol 55. Hindustan Book Agency, Gurgaon. https://doi.org/10.1007/978-93-86279-39-2_8
Download citation
DOI: https://doi.org/10.1007/978-93-86279-39-2_8
Publisher Name: Hindustan Book Agency, Gurgaon
Print ISBN: 978-81-85931-98-2
Online ISBN: 978-93-86279-39-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)