Finitely constrained classes of homogeneous directed graphs

DOI10.2307/2275255zbMath0795.03043OpenAlexW2153221243MaRDI QIDQ4292598

Brenda J. Latka

Publication date: 1 September 1994

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2275255

zbMATH Keywords

algorithmstructure theoremsantichaintournamentshomogeneous structuresfinite relational languagewell- quasi-order

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Models with special properties (saturated, rigid, etc.) (03C50)

Related Items (7)

Recent Progress on Well-Quasi-ordering Graphs ⋮ Forbidden substructures and combinatorial dichotomies: WQO and universality ⋮ Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture ⋮ Unnamed Item ⋮ Minimal antichains in well-founded quasi-orders with an application to tournaments ⋮ Computers and discovery in algebraic graph theory ⋮ On well quasi-order of graph classes under homomorphic image orderings

Cites Work

• On countable stable structures which are homogeneous for a finite relational language
• Unnamed Item

This page was built for publication: Finitely constrained classes of homogeneous directed graphs