Polynomial-time algorithms exist for all CMSO2-expressible sparse induced subgraph problems in P7-free graphs of bounded clique number.
Paths, trees, and flowers
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Sparse induced subgraphs in $P_7$-free graphs of bounded clique number
Polynomial-time algorithms exist for all CMSO2-expressible sparse induced subgraph problems in P7-free graphs of bounded clique number.