Title of article
The Depth-First Search Tree Structure of TKℵ0-Free Graphs
Author/Authors
Diestel، نويسنده , , R.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1994
Pages
3
From page
260
To page
262
Abstract
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.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1994
Journal title
Journal of Combinatorial Theory Series B
Record number
1525903
Link To Document