A cornerstone theorem in the Graph Minors series of Robertson and Seymou...
A brick is a 3-connected graph such that the graph obtained from it by
d...
Let P be a graph with a vertex v such that P v is a forest,
and let Q be...
We prove that if a graph has a tree-decomposition of width at most w, th...