1 problem

0 votes0 replies1 view
The polynomial-time MWIS conjecture for forests with at most three leaves per component
Polynomial-time MWIS conjecture. The problem $\textsc{MWIS}\$ is solvable in polynomial time on $H$ -free graphs.
Conjectureopengraph-algorithms induced-subgraph-classes maximum-independent-setarXiv posted 2 days ago

The polynomial-time MWIS conjecture for forests with at most three leaves per component