The depth-first search tree structure of \(TK_{\aleph_ 0}\)-free graphs

DOI10.1006/jctb.1994.1048zbMath0809.05079OpenAlexW1970364030MaRDI QIDQ1333343

Reinhard Diestel

Publication date: 13 September 1994

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1994.1048

zbMATH Keywords

spanning treedepth-first search treeinfinite complete graphfinite tree-width

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75)

Related Items (4)

Some recent progress and applications in graph minor theory ⋮ End spaces and tree-decompositions ⋮ A unified existence theorem for normal spanning trees ⋮ Excluding a countable clique

This page was built for publication: The depth-first search tree structure of \(TK_{\aleph_ 0}\)-free graphs