Pages that link to "Item:Q4882496"
From MaRDI portal
The following pages link to Equivalent definitions of recognizability for sets of graphs of bounded tree-width (Q4882496):
Displaying 15 items.
- Recognizability equals definability for graphs of bounded treewidth and bounded chordality (Q322323) (← links)
- On computing graph minor obstruction sets (Q1575945) (← links)
- Recognizability, hypergraph operations, and logical types (Q2496296) (← links)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- Myhill-Nerode Methods for Hypergraphs (Q2872101) (← links)
- Bicycles and Spanning Trees (Q3715129) (← links)
- Recognizable sets of graphs: equivalent definitions and closure properties (Q4286529) (← links)
- Recognizability equals definability for partial k-paths (Q4572008) (← links)
- Definability equals recognizability for graphs of bounded treewidth (Q4635898) (← links)
- (Q5028484) (← links)
- Computing Tree Decompositions (Q5042458) (← links)
- A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth (Q5062107) (← links)
- Recognizable sets of graphs of bounded tree-width (Q5096279) (← links)
- \(K_4\)-free graphs as a free algebra (Q5111293) (← links)
- (Q5874536) (← links)
