scientific article; zbMATH DE number 3902705

MaRDI QIDQ3680875zbMATH OpenFDO

Authors Neil Robertson, Paul Seymour

Publication date 1984

zbMATH Keywords

antichainminortree-widthWagner's conjecturewell-quasi-ordering

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Trees (05C05) Graph theory (05C99)

Recommendations

• Graph minors. IV: Tree-width and well-quasi-ordering
• scientific article; zbMATH DE number 772777
• Recent progress on well-quasi-ordering graphs
• Graph minors. XVIII: Tree-decompositions and well-quasi-ordering
• Graph minors. XX: Wagner's conjecture

Cited in

(15)

• A Menger-like property of tree-width: The finite case
• Grids and their minors
• A partial k-arboretum of graphs with bounded treewidth
• Algorithms and obstructions for linear-width and related search parameters
• On width measures and topological problems on semi-complete digraphs
• The theory of guaranteed search on graphs
• Which graphs allow infinite nonrepetitive walks?
• Graph minors. IV: Tree-width and well-quasi-ordering
• scientific article; zbMATH DE number 3885965 (Why is no real title available?)
• Recent progress on well-quasi-ordering graphs
• scientific article; zbMATH DE number 772777 (Why is no real title available?)
• Clique-width and well-quasi-ordering of triangle-free graph classes
• Twin-width IV: ordered graphs and matrices
• Tree-width and path-width of comparability graphs of interval orders
• The structure of the models of decidable monadic theories of graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3680875)