Graph Minors. XIX. Well-quasi-ordering on a surface

2003/12/10 by Neil Robertson, Paul Seymour, P.D. Seymour · 7 citations
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Combinatorics #Conjecture #Discrete mathematics #Geometry #Graph #Graph minor #Limits and Structures in Graph Theory #Line graph #Mathematics #Minor (academic) #Surface (topology) #Voltage graph #graph theory and CDMA systems

paper · doi:10.1016/j.jctb.2003.08.005

published in Journal of Combinatorial Theory, Series B 90(2), 325-385 (Elsevier BV)

openalex publication_date 2003/12/10 · crossref created 2003/12/10 · crossref issued 2004/03/01 · crossref published 2004/03/01 · crossref published-print 2004/03/01 · crossref deposited 2019/02/16 · openalex created_date 2025/10/10 · crossref indexed 2026/03/03 · openalex updated_date 2026/07/23

Citations

• Graph Minors
• Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering
• Graph Minors. XI. Circuits on a Surface
• Graph minors. VI. Disjoint paths across a disc
• Hadwiger's Conjecture is True for Almost Every Graph
• Normal hypergraphs and the perfect graph conjecture
• Graph minors. VII. Disjoint paths on a surface
• Kneser's conjecture, chromatic number, and homotopy
• Graph Minors .XII. Distance on a Surface
• Graph Minors .XIV. Extending an Embedding
• A simple proof of the Erdös-Chao Ko-Rado theorem
• On the conjecture of hajós
• Hajós' graph-coloring conjecture: Variations and counterexamples
• Graph minors. IV. Tree-width and well-quasi-ordering
• Graph minors. VIII. A kuratowski theorem for general surfaces
• Some remarks on the theory of graphs
• Graph minors. X. Obstructions to tree-decomposition
• Graph Minors. XX. Wagner's conjecture
• A characterization of perfect graphs
• The Ramsey number R(3, t) has order of magnitude t2/log t
• Graph Minors

Cited by

• Graph structure theorem [wikipedia]