Graph minors. II. Algorithmic aspects of tree-width
References (17)
- et al.
Graph minors. I. Excluding a forest
J. Combin. Theory Ser. B
(1983) - et al.
Graph minors. III. Planar tree-width
J. Combin. Theory Ser. B
(1984) Disjoint paths in graphs
Discrete Math.
(1980)2-linked graphs
European J. Combin
(1980)- et al.
Complexity of finding embeddings in a k-tree
(1984) - et al.
Computers and Intractability
(1979) On the complexity of combinatorial problems
Networks
(1975)- et al.
Searching and pebbling
(1984)
There are more references available in the full text version of this article.
Cited by (0)
- ∗
Research partially supported by NSF Grant MCS 8103440. Present address: Bell Communications Research. Inc., Morris Research and Engineering Center, 435 South Street, Morristown, New Jersey 07960.
Copyright © 1986 Published by Elsevier Inc.