Author:
Middendorf Matthias,Pfeiffer Frank
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference10 articles.
1. Lichtenstein, D.: Planar formulae and their uses,SIAM J. Comput. 11 (1982), 329?343.
2. Lomonosov, M. V.: Combinatorial approaches to multiflow problems,Discrete Applied Mathematics 11 (1985), 1?93.
3. Matou?ek, J., Thomas, R.: On the complexity of finding iso- and other morphisms for partialk-trees, In preparation (manuscript May 1988).
4. Middendorf, M., Pfeiffer, F.: Edge disjoint paths in graphs with bounded tree-whidth, In preparation.
5. Robertson, N., Seymour, P. D.: Graph minors V. Excluding a planar graph,J. Combinatorial Theory (Ser. B),36 (1984), 49?64.
Cited by
85 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献