The following pages link to (Q4381404):
Displaying 19 items.
- Recognizability equals definability for graphs of bounded treewidth and bounded chordality (Q322323) (← links)
- On self-duality of branchwidth in graphs of bounded genus (Q411870) (← links)
- Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
- Matroid tree-width (Q852702) (← links)
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability (Q1176232) (← links)
- A monadic second-order definition of the structure of convex hypergraphs. (Q1400707) (← links)
- Fly-automata for checking \(\mathrm{MSO}_2\) graph properties (Q1752502) (← links)
- Uniform and nonuniform recognizability. (Q1853746) (← links)
- Rationality in algebras with a series operation (Q1854484) (← links)
- Towards a language theory for infinite N-free pomsets. (Q1874399) (← links)
- The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs (Q1960417) (← links)
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees (Q2403697) (← links)
- The monadic second-order logic of graphs. XV: On a conjecture by D. Seese (Q2494727) (← links)
- Recognizability, hypergraph operations, and logical types (Q2496296) (← links)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- Causality in Bounded Petri Nets is MSO Definable (Q2820695) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- GETGRATS (Q4923529) (← links)
