@inproceedings{002e6e6a4d8e4501a2e38d88a698ee19,
title = "Induced matchings in subcubic planar graphs",
abstract = "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.",
author = "R.J. Kang and M. Mnich and T. M{\"u}ller",
year = "2010",
doi = "10.1007/978-3-642-15781-3_10",
language = "English",
isbn = "978-3-642-15780-6",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "112--122",
editor = "{Berg, de}, M. and U. Meyer",
booktitle = "Algorithms - ESA 2010 (18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II)",
address = "Germany",
}