Tight bounds on maximal and maximum matchings

Therese Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G Kobourov

Research output: Contribution to journalArticle

45 Citations (Scopus)

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.

Original languageEnglish (US)
Pages (from-to)7-15
Number of pages9
JournalDiscrete Mathematics
Volume285
Issue number1-3
DOIs
StatePublished - Aug 6 2004

Fingerprint

Maximum Matching
Lower bound
Graph in graph theory
Maximum Degree
Planar graph
Connected graph
Class

Keywords

  • Bounded maximum degree
  • Bounds
  • Matching
  • Planar graphs

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Biedl, T., Demaine, E. D., Duncan, C. A., Fleischer, R., & Kobourov, S. G. (2004). Tight bounds on maximal and maximum matchings. Discrete Mathematics, 285(1-3), 7-15. https://doi.org/10.1016/j.disc.2004.05.003

Tight bounds on maximal and maximum matchings. / Biedl, Therese; Demaine, Erik D.; Duncan, Christian A.; Fleischer, Rudolf; Kobourov, Stephen G.

In: Discrete Mathematics, Vol. 285, No. 1-3, 06.08.2004, p. 7-15.

Research output: Contribution to journalArticle

Biedl, T, Demaine, ED, Duncan, CA, Fleischer, R & Kobourov, SG 2004, 'Tight bounds on maximal and maximum matchings', Discrete Mathematics, vol. 285, no. 1-3, pp. 7-15. https://doi.org/10.1016/j.disc.2004.05.003
Biedl, Therese ; Demaine, Erik D. ; Duncan, Christian A. ; Fleischer, Rudolf ; Kobourov, Stephen G. / Tight bounds on maximal and maximum matchings. In: Discrete Mathematics. 2004 ; Vol. 285, No. 1-3. pp. 7-15.
@article{2411645a2ce740659a9ac1b3fbc34b33,
title = "Tight bounds on maximal and maximum matchings",
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 = "Bounded maximum degree, Bounds, Matching, Planar graphs",
author = "Therese Biedl and Demaine, {Erik D.} and Duncan, {Christian A.} and Rudolf Fleischer and Kobourov, {Stephen G}",
year = "2004",
month = "8",
day = "6",
doi = "10.1016/j.disc.2004.05.003",
language = "English (US)",
volume = "285",
pages = "7--15",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - Tight bounds on maximal and maximum matchings

AU - Biedl, Therese

AU - Demaine, Erik D.

AU - Duncan, Christian A.

AU - Fleischer, Rudolf

AU - Kobourov, Stephen G

PY - 2004/8/6

Y1 - 2004/8/6

N2 - 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.

AB - 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.

KW - Bounded maximum degree

KW - Bounds

KW - Matching

KW - Planar graphs

UR - http://www.scopus.com/inward/record.url?scp=3142607299&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=3142607299&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2004.05.003

DO - 10.1016/j.disc.2004.05.003

M3 - Article

AN - SCOPUS:3142607299

VL - 285

SP - 7

EP - 15

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -