vix.ing · top · new · best · stats

Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering

2003/07/31 by Neil Robertson, Paul Seymour · 14 citations
Computer Science · Mathematics · #1-planar graph #Advanced Graph Theory Research #Artificial intelligence #Chordal graph #Class (philosophy) #Combinatorics #Component (thermodynamics) #Computer science #Conjecture #Discrete mathematics #Graph #Graph minor #Graph power #Humanities #Limits and Structures in Graph Theory #Line graph #Mathematics #Minor (academic) #Physics #Robertson–Seymour theorem #Tree (set theory) #semigroups and automata theory

paper · pdf · doi:10.1016/s0095-8956(03)00067-4

published in Journal of Combinatorial Theory, Series B 89(1), 77-108 (Elsevier BV)

openalex publication_date 2003/07/31 · crossref created 2003/07/31 · crossref issued 2003/09/01 · crossref published 2003/09/01 · crossref published-print 2003/09/01 · crossref deposited 2019/03/17 · openalex created_date 2025/10/10 · crossref indexed 2026/01/21 · openalex updated_date 2026/08/02

Citations

Cited by