Pages that link to "Item:Q5283438"
From MaRDI portal
The following pages link to Definability in First Order Theories of Graph Orderings (Q5283438):
Displaying 10 items.
- Definability in the substructure ordering of simple graphs (Q259729) (← links)
- Definability in the embeddability ordering of finite directed graphs. II (Q2314424) (← links)
- Definability in the substructure ordering of finite directed graphs (Q2665828) (← links)
- On first-order definable colorings (Q3194868) (← links)
- Well-Quasi Orders and Hierarchy Theory (Q3295154) (← links)
- First-order Definable Retraction Problems for Posets and Reflexive Graphs (Q3437257) (← links)
- First-Order Definability of Trees and Sparse Random Graphs (Q3438138) (← links)
- (Q4683860) (← links)
- Definability of Recursive Predicates in the Induced Subgraph Order (Q5224502) (← links)
- Segment transit function of the induced path function of graphs and its first-order definability (Q6132572) (← links)