New results on induced matchings

Martin Charles Golumbic, Moshe Lewenstein

Research output: Contribution to journalArticlepeer-review

103 Scopus citations


A matching in a graph is a set of edges no two of which share a common vertex. A matching M is an induced matching if no edge connects two edges of M. The problem of finding a maximum induced matching is known to be NP-Complete in general and specifically for bipartite graphs and for 3-regular planar graphs. The problem has been shown to be polynomial for several classes of graphs. In this paper we generalize the results to wider classes of graphs, and improve the time complexity of previously known results.

Original languageEnglish
Pages (from-to)157-165
Number of pages9
JournalDiscrete Applied Mathematics
Issue number1-3
StatePublished - 15 Apr 2000


  • Design and analysis of algorithms
  • Graph theory
  • Induced matchings
  • Matchings
  • Perfect graphs
  • Strong matchings


Dive into the research topics of 'New results on induced matchings'. Together they form a unique fingerprint.

Cite this