The structure of \(TK_ a\)-free graphs

DOI10.1016/0095-8956(92)90054-2zbMath0764.05078OpenAlexW204002426MaRDI QIDQ1193564

Reinhard Diestel

Publication date: 27 September 1992

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

Full work available at URL: https://doi.org/10.1016/0095-8956(92)90054-2

zbMATH Keywords

characterizationstructuretree-decompositionnormal spanning trees\(TK_ a\)-free graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (1)

Normal Tree Orders for Infinite Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Graph minors. XVIII: Tree-decompositions and well-quasi-ordering
• Unterteilungen vollständiger Graphen in Graphen mit unendlicher chromatischer Zahl
• Simplicial tree-decompositions of infinite graphs. I
• Ein Zerlegungssatz für unendliche Graphen und seine Anwendung auf Homomorphiebasen
• Zusammenzüge und Unterteilungen von Graphen

This page was built for publication: The structure of \(TK_ a\)-free graphs