2 problems

Let $G$ be a planar graph, and let $k$ be a nonnegative integer. Pairwise disjoint cycles in $G$ have no common vertices. Jones' conjecture. If $G$ contains no more than $k$ pairwi…

Hertz et al.'s conjecture. The Independent Feedback Vertex Set problem should be polynomial-time solvable for $H$-free graphs whenever $H$ is a forest and each connected component…