Graph minors. III. Planar tree-width
作者： Neil Robertson , P.D Seymour
DOI: 10.1016/0095-8956(84)90013-3
关键词:
摘要: Abstract The “tree-width” of a graph is defined and it proved that for any fixed planar H, every with sufficiently large tree-width has minor isomorphic to H. This result several applications which are described in other papers this series.
core.ac.uk
elsevier.com
sci-hub.se 参考文章(1)
Neil Robertson, P.D. Seymour, Graph minors. I. Excluding a forest Journal of Combinatorial Theory, Series B. ,vol. 35, pp. 39- 61 ,(1983) , 10.1016/0095-8956(83)90079-5