Tight bounds on maximal and maximum matchings

https://doi.org/10.1016/j.disc.2004.05.003Get rights and content
Under an Elsevier user license
open archive

Abstract

In this paper, we study lower bounds on the size of maximal and maximum matchings in 3-connected planar graphs and graphs with bounded maximum degree. For each class, we give a lower bound on the size of matchings, and show that the bound is tight for some graph within the class.

Keywords

Matching
Bounds
Planar graphs
Bounded maximum degree

Cited by (0)

1

Research supported by NSERC.

2

Research supported by NSF Grant ACR-0222920.