Locally Excluding a Minor

摘要: We introduce the concept of locally excluded minors. Graph classes excluding a minor are common generalisation and graph with bounded local tree-width. show that first-order model-checking is fixed-parameter tractable on any class graphs minor. This strictly generalises analogous results by Flum Grohe Frick As an important consequence proof we obtain algorithms for problems such as dominating or independent set minor, where now parameter size also study minors, may grow slowly again, graphs.