For every fixed k and g, maximum-weight stable sets can be found in polynomial time in graphs with odd cycle packing number at most k and Euler genus at most g.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The stable set problem in graphs with bounded genus and bounded odd cycle packing number
For every fixed k and g, maximum-weight stable sets can be found in polynomial time in graphs with odd cycle packing number at most k and Euler genus at most g.