Pages that link to "Item:Q259729"
From MaRDI portal
The following pages link to Definability in the substructure ordering of simple graphs (Q259729):
Displayed 9 items.
- Definability in the embeddability ordering of finite directed graphs. II (Q2314424) (← links)
- The poset of graphs ordered by induced containment (Q2326334) (← links)
- Definability in the substructure ordering of finite directed graphs (Q2665828) (← links)
- Complexity in Young's lattice (Q2668002) (← links)
- Well-Quasi Orders and Hierarchy Theory (Q3295154) (← links)
- (Q4683860) (← links)
- The Subtrace Order and Counting First-Order Logic (Q5042249) (← links)
- Definability of Recursive Predicates in the Induced Subgraph Order (Q5224502) (← links)
- Definability in First Order Theories of Graph Orderings (Q5283438) (← links)