Finitely constrained classes of homogeneous directed graphs
From MaRDI portal
Publication:4292598
Recommendations
Cites work
Cited in
(11)- Minimal antichains in well-founded quasi-orders with an application to tournaments
- Computers and discovery in algebraic graph theory
- Forbidden substructures and combinatorial dichotomies: WQO and universality
- On well quasi-order of graph classes under homomorphic image orderings
- Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture
- Recent progress on well-quasi-ordering graphs
- The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
- scientific article; zbMATH DE number 861310 (Why is no real title available?)
- scientific article; zbMATH DE number 887760 (Why is no real title available?)
- scientific article; zbMATH DE number 5030273 (Why is no real title available?)
- scientific article; zbMATH DE number 2230290 (Why is no real title available?)
This page was built for publication: Finitely constrained classes of homogeneous directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4292598)