Pages that link to "Item:Q2570131"

The following pages link to The first order definability of graphs with separators via the Ehrenfeucht game (Q2570131):

Displaying 3 items.

• The first order definability of graphs: Upper bounds for quantifier depth (Q860411) (← links)
• Decomposable graphs and definitions with no quantifier alternation (Q2461780) (← links)
• Combinatorial games on Galton-Watson trees involving several-generation-jump moves (Q6547218) (← links)