2 problems

Let $g$ be a nonnegative integer, and let $G$ be a graph of Euler genus at most $g$. A graph parameter is $(a,b)$-self-dual if its value on the dual graph is bounded in terms of it…

Polynomial-time branchwidth conjecture. Branchwidth can be computed in polynomial time on $H$-minor-free graphs.