THE DEPTH-1ST SEARCH TREE STRUCTURE OF TK(ALEPH-0)-FREE GRAPHS

被引：4
作者：
DIESTEL, R
机构：
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES B | 1994年 / 61卷 / 02期
关键词：
D O I：
10.1006/jctb.1994.1048
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We characterize the graphs containing no subdivided infinite complete graph, by their normal, or depth-first search, tree structure. This implies the recent result of Robertson, Seymour and Thomas that these are precisely the graphs of finite tree-width. (C) 1994 Academic Press, Inc.
引用
收藏
页码：260 / 262
页数：3
相关论文
共 9 条
1