Pages that link to "Item:Q3196630"
From MaRDI portal
The following pages link to Deciding first-order properties of locally tree-decomposable structures (Q3196630):
Displaying 7 items.
- Enumeration for FO Queries over Nowhere Dense Graphs (Q5889796) (← links)
- Finding large degree-anonymous subgraphs is hard (Q5964077) (← links)
- Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes (Q6135763) (← links)
- Parameterized Counting and Cayley Graph Expanders (Q6158357) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- Model checking on interpretations of classes of bounded local cliquewidth (Q6649489) (← links)
- Complexity of maker-breaker games on edge sets of graphs (Q6657252) (← links)