Abstract. In this paper, we study bounds on maximal and maximum matchings in special graph classes, specifically triangulated graphs and graphs with bounded maximum degree. For each class, we give a lower bound on the size of matchings, and prove that it is tight for some graph within the class. 1 Introduction The problem of finding a maximum matching in a graph has a long and dis-tinguished history beginning with the early work of Petersen , K&quot;onig , Hall , and Tutte . The fastest algorithms to find a maximum matching inan n-vertex m-edge graph takes O(pnm) time, for bipartite graphs  as wellas for general graphs 
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.