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.
|Title of host publication||Algorithms - ESA 2010|
|Subtitle of host publication||18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II|
|Publication status||Published - 2010|
|Series||Lecture Notes in Computer Science|
Kang, R. J., Mnich, M., & Müller, T. (2010). Induced Matchings in Subcubic Planar Graphs. In Algorithms - ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II (pp. 112-122). Springer. Lecture Notes in Computer Science, Vol.. 6347 https://doi.org/10.1007/978-3-642-15781-3_10