Pages that link to "Item:Q2570131"
From MaRDI portal
The following pages link to The first order definability of graphs with separators via the Ehrenfeucht game (Q2570131):
Displaying 5 items.
- The first order definability of graphs: Upper bounds for quantifier depth (Q860411) (← links)
- Two consequences of the dichotomy theorem on first order definability of graphs. (Q1776035) (← links)
- Decomposable graphs and definitions with no quantifier alternation (Q2461780) (← links)
- First-order Definable Retraction Problems for Posets and Reflexive Graphs (Q3437257) (← links)
- Combinatorial games on Galton-Watson trees involving several-generation-jump moves (Q6547218) (← links)