Work

Odd faces as a parameter for maximum independent set in embedded graphs

Year: 2026
Type: preprint
Abstract: We give a polynomial-time algorithm for finding a maximum weight independent set in a graph embedded in a surface of bounded genus and with a bounded number of vertex-disjoint odd faces. In particular, we obtain an algorithm for graphs with an even-faced embedding in a torus and for planar graphs with a bounded number of odd faces, answering a question of Thomassé (2018) and a question of Choi, Gorsky, Kim, McFarland, and Wiederrecht (2025) respectively. We reduce the original problem to finding a minimum cost non-negative integer circulation with homology constraints in the dual of a certain double cover of the original graph.
Language: English
Open Access status: green
OpenAlex ID: W7235086733
Cites: 62
Cited by:
Related to: 10