However, for planar graphs, and more generally, for graphs excluding some fixed graph as a minor, a vertex cover of size "k" can be found in time "formula_28", i.e., the problem is subexponential fixed-parameter tractable.