Recent progress on well-quasi-ordering graphs
From MaRDI portal
Publication:3295151
DOI10.1007/978-3-030-30229-0_7zbMATH Open1443.05177OpenAlexW2997340883MaRDI QIDQ3295151FDOQ3295151
Authors: Chun-Hung Liu
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
Recommendations
Directed graphs (digraphs), tournaments (05C20) Partial orders, general (06A06) Graph theory (05C99)
Cites Work
- Graph theory
- Graph minors. XX: Wagner's conjecture
- Theory of relations. Transl. from the French by P. Clote
- Graph minors. XIII: The disjoint paths problem
- Subgraphs and well‐quasi‐ordering
- On Independent Circuits Contained in a Graph
- Circle graph obstructions
- Rao's degree sequence conjecture
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications
- The theory of well-quasi-ordering: a frequently discovered concept
- Graph minors XXIII. Nash-Williams' immersion conjecture
- Two forbidden induced subgraphs and well-quasi-ordering
- Boundary properties of well-quasi-ordered sets of graphs
- Induced subgraphs and well‐quasi‐ordering
- Ordering by Divisibility in Abstract Algebras
- Two short proofs of the bounded case of S. B. Rao's degree sequence conjecture
- Title not available (Why is that?)
- A semigroup proof of the bounded degree case of S.B. Rao's conjecture on degree sequences and a bipartite analogue
- Title not available (Why is that?)
- Title not available (Why is that?)
- A well-quasi-order for tournaments
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Rank-Width and Well-Quasi-Ordering
- Tournament minors
- Letter graphs and well-quasi-order by induced subgraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Well-quasi-order of relabel functions
- On well-quasi-ordering finite structures with labels
- Title not available (Why is that?)
- Canonical antichains of unit interval and bipartite permutation graphs
- Excluding a long double path minor
- Well-quasi-ordering versus clique-width: new results on bigenic classes
- Well-quasi-ordering does not imply bounded clique-width
- Labelled induced subgraphs and well-quasi-ordering
- Title not available (Why is that?)
- Bipartite induced subgraphs and well-quasi-ordering
- Rank-width: algorithmic and structural results
- Title not available (Why is that?)
- Graphs without \(K_ 4\) and well-quasi-ordering
- Well-quasi-ordering \(H\)-contraction-free graphs
- Wohlquasigeordnete Klassen endlicher Graphen
- Title not available (Why is that?)
- On well-quasi-ordering-finite graphs by immersion
- Excluding subdivisions of bounded degree graphs
- Well-quasi-order for permutation graphs omitting a path and a clique
- Finitely constrained classes of homogeneous directed graphs
Cited In (6)
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)