Induced matchings in subcubic planar graphs

Ross J. Kang*, Matthias Mnich, Tobias Müller

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review


We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, finds an induced matching of size at least m/9. This is best possible.
Original languageEnglish
Pages (from-to)1383-1411
JournalSiam Journal on Discrete Mathematics
Issue number3
Publication statusPublished - 2012
Externally publishedYes


Dive into the research topics of 'Induced matchings in subcubic planar graphs'. Together they form a unique fingerprint.

Cite this