Pages that link to "Item:Q2496296"
From MaRDI portal
The following pages link to Recognizability, hypergraph operations, and logical types (Q2496296):
Displayed 5 items.
- 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)
- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions (Q3508555) (← links)
- Relational structures constructible by quantifier free definable operations (Q5444700) (← links)