Recent Progress on Well-Quasi-ordering Graphs
From MaRDI portal
Publication:3295151
DOI10.1007/978-3-030-30229-0_7zbMath1443.05177OpenAlexW2997340883MaRDI QIDQ3295151
Publication date: 8 July 2020
Published in: Trends in Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-30229-0_7
Partial orders, general (06A06) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Boundary properties of well-quasi-ordered sets of graphs
- Two short proofs of the bounded case of S. B. Rao's degree sequence conjecture
- Rao's degree sequence conjecture
- A semigroup proof of the bounded degree case of S.B. Rao's conjecture on degree sequences and a bipartite analogue
- Well-quasi-order of relabel functions
- A well-quasi-order for tournaments
- Canonical antichains of unit interval and bipartite permutation graphs
- Graph minors. XX: Wagner's conjecture
- Labelled induced subgraphs and well-quasi-ordering
- On well-quasi-ordering finite structures with labels
- Graph minors XXIII. Nash-Williams' immersion conjecture
- Graphs without \(K_ 4\) and well-quasi-ordering
- Theory of relations. Transl. from the French by P. Clote
- On well-quasi-ordering-finite graphs by immersion
- Circle graph obstructions
- Letter graphs and well-quasi-order by induced subgraphs
- Excluding subdivisions of bounded degree graphs
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications
- Graph minors. XIII: The disjoint paths problem
- Excluding a long double path minor
- Two forbidden induced subgraphs and well-quasi-ordering
- Tournament minors
- Well-quasi-order for permutation graphs omitting a path and a clique
- Rank-width: algorithmic and structural results
- Well-quasi-ordering \(H\)-contraction-free graphs
- Wohlquasigeordnete Klassen endlicher Graphen
- The theory of well-quasi-ordering: a frequently discovered concept
- Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes
- Well-quasi-ordering Does Not Imply Bounded Clique-width
- Bipartite induced subgraphs and well-quasi-ordering
- Rank-Width and Well-Quasi-Ordering
- Subgraphs and well‐quasi‐ordering
- Finitely constrained classes of homogeneous directed graphs
- On Independent Circuits Contained in a Graph
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Induced subgraphs and well‐quasi‐ordering
- Ordering by Divisibility in Abstract Algebras
- Induced minors and well-quasi-ordering
