Well quasi-order in combinatorics: embeddings and homomorphisms
From MaRDI portal
Publication:3179078
Recommendations
Cited in
(16)- scientific article; zbMATH DE number 4170966 (Why is no real title available?)
- scientific article; zbMATH DE number 152059 (Why is no real title available?)
- Well quasi orders in a categorical setting
- Atomicity and Well Quasi-Order for Consecutive Orderings on Words and Permutations
- Intersection quasi-orderings: An alternative proof
- A counterexample regarding labelled well-quasi-ordering
- Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahrestagung der Deutschen Mathematiker-Vereinigung (DMV), Hamburg, Germany, September 21--25, 2015 and the Dagstuhl seminar 16031 on well quasi-orders in computer science, Schloss Dagstuhl, Germany, January 17--22, 2016
- On well quasi-order of graph classes under homomorphic image orderings
- Labelled well-quasi-order for permutation classes
- On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders
- Well-Quasi Orders and Hierarchy Theory
- Decidability of well quasi-order and atomicity for equivalence relations under embedding orderings
- Hereditarily structurally complete positive logics
- Algebraic representation, dualities and beyond
- Well‐quasi‐ordering and finite distinguishing number
- scientific article; zbMATH DE number 4031662 (Why is no real title available?)
This page was built for publication: Well quasi-order in combinatorics: embeddings and homomorphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179078)