scientific article; zbMATH DE number 1136093
From MaRDI portal
Publication:4381404
Recommendations
- Definability equals recognizability for graphs of bounded treewidth
- Equivalent definitions of recognizability for sets of graphs of bounded tree-width
- Recognizable sets of graphs of bounded tree-width
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
Cited in
(31)- Treewidth and logical definability of graph products
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
- A monadic second-order definition of the structure of convex hypergraphs.
- Fly-automata for checking \(\mathrm{MSO}_2\) graph properties
- Uniform and nonuniform recognizability.
- Rationality in algebras with a series operation
- Towards a language theory for infinite N-free pomsets.
- The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs
- Measuring what matters: a hybrid approach to dynamic programming with treewidth
- Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees
- The monadic second-order logic of graphs. XV: On a conjecture by D. Seese
- Recognizability, hypergraph operations, and logical types
- The recognizability of sets of graphs is a robust property
- Causality in bounded Petri nets is MSO definable
- Fixed-parameter tractability of treewidth and pathwidth
- Regularity equals monadic second-order definability for quasi-trees
- Recognizability equals definability for graphs of bounded treewidth and bounded chordality
- Fly-automata for checking monadic second-order properties of graphs of bounded tree-width
- On Several Proofs of the Recognizability Theorem
- On self-duality of branchwidth in graphs of bounded genus
- scientific article; zbMATH DE number 1104369 (Why is no real title available?)
- Recognizability equals definability for partial k-paths
- Definability equals recognizability for graphs of bounded treewidth
- Equivalent definitions of recognizability for sets of graphs of bounded tree-width
- GETGRATS: a summary of scientific results (with annotated bibliography)
- Recognizable sets of graphs of bounded tree-width
- Definable decompositions for graphs of bounded linear cliquewidth
- Definability equals recognizability for k-outerplanar graphs
- Definable decompositions for graphs of bounded linear cliquewidth
- Trees, grids, and MSO decidability: from graphs to matroids
- Matroid tree-width
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4381404)
