Odd faces as a parameter for maximum independent set in embedded graphs
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.
Authors
- Samuel Fiorini (ORCID: https://orcid.org/0000-0002-6845-9008)
- Stefan Kober (ORCID: https://orcid.org/0000-0003-2610-1494)
- Caleb McFarland (ORCID: https://orcid.org/0009-0002-9844-6256)
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-16
- DOI
- https://doi.org/10.48550/arxiv.2611.21256
- Primary Topic
- Advanced Graph Theory Research
- Type
- preprint