Graph-Theoretic Concepts in Computer Science

Volume 5911 of the series Lecture Notes in Computer Science pp 143-153

Connected Feedback Vertex Set in Planar Graphs

  • Alexander GrigorievAffiliated withDepartment of Quantitative Economics, Maastricht University
  • , René SittersAffiliated withDepartment of Econometrics and Operations Research, VU University

* Final gross prices may vary according to local VAT.

Get Access


We study the problem of finding a minimum tree spanning the faces of a given planar graph. We show that a constant factor approximation follows from the unconnected version if the minimum degree is 3. Moreover, we present a polynomial time approximation scheme for both the connected and unconnected version.