1 problem

Polynomial-time MIS conjecture for graphs forbidding independent planar minors
Independent-planar-minor MIS conjecture. For every planar $H$ and every $k$ , MIS is polynomial-time solvable on the class of $kH$ -free graphs.
openFrom papersmaximum-independent-set parameterized-complexity planar-minors
0 responses
2

Polynomial-time MIS conjecture for graphs forbidding independent planar minors