Pages that link to "Item:Q3778739"
From MaRDI portal
The following pages link to The Complexity of Defining a Relation on a Finite Graph (Q3778739):
Displaying 9 items.
- On the definability of properties of finite graphs (Q791548) (← links)
- Farrell polynomials on graphs of bounded tree width (Q1398293) (← links)
- Tree-width and the monadic quantifier hierarchy. (Q1401360) (← links)
- Two consequences of the dichotomy theorem on first order definability of graphs. (Q1776035) (← links)
- Succinct definitions in the first order theory of graphs (Q2368907) (← links)
- Defining relations for deterministic graphs (Q2901663) (← links)
- Relative expressiveness of the edge/adjacency language for graph theory (Q3220638) (← links)
- On the Encoding of Relations by Graphs (Q3346319) (← links)
- Second-order and Inductive Definability on Finite Structures (Q3797174) (← links)