Pages that link to "Item:Q2566292"
From MaRDI portal
The following pages link to The recognizability of sets of graphs is a robust property (Q2566292):
Displaying 7 items.
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- A syntactic congruence for languages of birooted trees (Q906981) (← links)
- Graph operations characterizing rank-width (Q1028455) (← links)
- Syntactic recognizability of graphs with fuzzy attributes (Q2445984) (← links)
- Algebraic recognizability of regular tree languages (Q2484441) (← links)
- Recognizability, hypergraph operations, and logical types (Q2496296) (← links)
- Simple monadic theories and partition width (Q3170562) (← links)
