Pages that link to "Item:Q5096279"
From MaRDI portal
The following pages link to Recognizable sets of graphs of bounded tree-width (Q5096279):
Displaying 5 items.
- Recognizability equals definability for graphs of bounded treewidth and bounded chordality (Q322323) (← links)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- Recognizable sets of graphs: equivalent definitions and closure properties (Q4286529) (← links)
- Definability equals recognizability for graphs of bounded treewidth (Q4635898) (← links)
- Equivalent definitions of recognizability for sets of graphs of bounded tree-width (Q4882496) (← links)