A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs

Thekla Hamm, Sukanya Pandey, Krisztina Szilágyi

Given a planar graph, a subset of its vertices called terminals, and $k\in \mathbb{N}$, the Face Cover Number problem asks whether the terminals lie on the boundaries of at most $…