Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs

We prove that any graph excluding one of K5 or K3, 3 as a minor has local treewidth bounded by 3k + 4. As a result, we can design practical polynomial-time approximation schemes for both minimization and maximization problems on these classes of non-planar graphs.