Recent progress on well-quasi-ordering graphs
From MaRDI portal
Publication:3295151
Recommendations
Cites work
- scientific article; zbMATH DE number 3146886 (Why is no real title available?)
- scientific article; zbMATH DE number 4094810 (Why is no real title available?)
- scientific article; zbMATH DE number 3754758 (Why is no real title available?)
- scientific article; zbMATH DE number 25645 (Why is no real title available?)
- scientific article; zbMATH DE number 1286524 (Why is no real title available?)
- scientific article; zbMATH DE number 3232673 (Why is no real title available?)
- scientific article; zbMATH DE number 3400958 (Why is no real title available?)
- scientific article; zbMATH DE number 3198033 (Why is no real title available?)
- scientific article; zbMATH DE number 3198864 (Why is no real title available?)
- A semigroup proof of the bounded degree case of S.B. Rao's conjecture on degree sequences and a bipartite analogue
- A well-quasi-order for tournaments
- Bipartite induced subgraphs and well-quasi-ordering
- Boundary properties of well-quasi-ordered sets of graphs
- Canonical antichains of unit interval and bipartite permutation graphs
- Circle graph obstructions
- Excluding a long double path minor
- Excluding subdivisions of bounded degree graphs
- Finitely constrained classes of homogeneous directed graphs
- Graph minors XXIII. Nash-Williams' immersion conjecture
- Graph minors. XIII: The disjoint paths problem
- Graph minors. XX: Wagner's conjecture
- Graph theory
- Graphs without \(K_ 4\) and well-quasi-ordering
- Induced subgraphs and well‐quasi‐ordering
- Labelled induced subgraphs and well-quasi-ordering
- Letter graphs and well-quasi-order by induced subgraphs
- On Independent Circuits Contained in a Graph
- On well-quasi-ordering finite structures with labels
- On well-quasi-ordering-finite graphs by immersion
- Ordering by Divisibility in Abstract Algebras
- Rank-Width and Well-Quasi-Ordering
- Rank-width: algorithmic and structural results
- Rao's degree sequence conjecture
- Subgraphs and well‐quasi‐ordering
- The theory of well-quasi-ordering: a frequently discovered concept
- Theory of relations. Transl. from the French by P. Clote
- Tournament minors
- Two forbidden induced subgraphs and well-quasi-ordering
- Two short proofs of the bounded case of S. B. Rao's degree sequence conjecture
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Well-quasi-order for permutation graphs omitting a path and a clique
- Well-quasi-order of relabel functions
- Well-quasi-ordering \(H\)-contraction-free graphs
- Well-quasi-ordering does not imply bounded clique-width
- Well-quasi-ordering versus clique-width: new results on bigenic classes
- Wohlquasigeordnete Klassen endlicher Graphen
Cited in
(6)- scientific article; zbMATH DE number 4002134 (Why is no real title available?)
- Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation
- Minimal universal and dense minor closed classes
- Preface
- scientific article; zbMATH DE number 3885965 (Why is no real title available?)
- scientific article; zbMATH DE number 3902705 (Why is no real title available?)
This page was built for publication: Recent progress on well-quasi-ordering graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3295151)
