Graph minors. IV. Tree-width and well-quasi-ordering
- 1 April 1990
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 48 (2), 227-254
- https://doi.org/10.1016/0095-8956(90)90120-o
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Graph minors. VIII. A kuratowski theorem for general surfacesJournal of Combinatorial Theory, Series B, 1990
- A menger-like property of tree-width: The finite caseJournal of Combinatorial Theory, Series B, 1990
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- Graph minors. V. Excluding a planar graphJournal of Combinatorial Theory, Series B, 1986
- Graph minors. III. Planar tree-widthJournal of Combinatorial Theory, Series B, 1984
- 103 Graphs that are irreducible for the projective planeJournal of Combinatorial Theory, Series B, 1979
- Wohlquasigeordnete Klassen endlicher GraphenJournal of Combinatorial Theory, Series B, 1972