Pages that link to "Item:Q2496296"
From MaRDI portal
The following pages link to Recognizability, hypergraph operations, and logical types (Q2496296):
Displaying 19 items.
- Compact labelings for efficient first-order model-checking (Q626458) (← links)
- Graph operations characterizing rank-width (Q1028455) (← links)
- Uniform and nonuniform recognizability. (Q1853746) (← links)
- The rank-width of edge-coloured graphs (Q2392245) (← links)
- Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
- A model-theoretic characterisation of clique width (Q2503407) (← links)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- $\mathbb F$ -Rank-Width of (Edge-Colored) Graphs (Q3014938) (← links)
- Simple monadic theories and partition width (Q3170562) (← links)
- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions (Q3508555) (← links)
- (Q4027629) (← links)
- Recognizable sets of graphs: equivalent definitions and closure properties (Q4286529) (← links)
- (Q4305341) (← links)
- Prefix-Recognizable Graphs and Monadic Logic (Q4412838) (← links)
- (Q5283020) (← links)
- Relational structures constructible by quantifier free definable operations (Q5444700) (← links)
- Developments in Language Theory (Q5711946) (← links)
- Clique-width of point configurations (Q5918571) (← links)
- Model checking on interpretations of classes of bounded local cliquewidth (Q6649489) (← links)