Graph minors. X. Obstructions to tree-decomposition

@article{Robertson1991GraphMX,
  title={Graph minors. X. Obstructions to tree-decomposition},
  author={Neil Robertson and Paul D. Seymour},
  journal={J. Comb. Theory, Ser. B},
  year={1991},
  volume={52},
  pages={153-190}
}
Graphs in this paper are finite and undirected and may have loops or multiple edges. The vertexand edge-sets of a graph G are denoted by V(G) and E(G). If G, = ( V1, E,), G2 = ( V2, E2) are subgraphs of a graph G, we denote the graphs (V1n V2,E1nE,) and (V,u V2, EluEZ) by G,nG, and G, u GZ, respectively. A separation of a graph G is a pair (G,, G2) of subgraphs with G1 u G2 = G and E(G1 n G2) = 0, and the order of this separation is f V(G, n G2)(. It sometimes happens with a graph G that for… CONTINUE READING
Highly Influential
This paper has highly influenced 36 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

DIRAC, In abstrakten Graphen vorhandene vollstandige 4-Graphen und ihre Unterteilungen

  • G A.
  • Math. Nachr
  • 1960
Highly Influential
10 Excerpts

WELSH, “Matroid Theory,

  • J A.D.
  • 1976
1 Excerpt

Similar Papers

Loading similar papers…