Pages that link to "Item:Q860411"
From MaRDI portal
The following pages link to The first order definability of graphs: Upper bounds for quantifier depth (Q860411):
Displaying 6 items.
- Locality and modular Ehrenfeucht-Fraïssé games (Q420850) (← links)
- Succinct definitions in the first order theory of graphs (Q2368907) (← links)
- Decomposable graphs and definitions with no quantifier alternation (Q2461780) (← links)
- The first order definability of graphs with separators via the Ehrenfeucht game (Q2570131) (← links)
- The Weisfeiler-Leman algorithm and recognition of graph properties (Q5925529) (← links)
- Combinatorial games on Galton-Watson trees involving several-generation-jump moves (Q6547218) (← links)
