scientific article; zbMATH DE number 1136093

zbMath0936.03036MaRDI QIDQ4381404

Denis Lapoire

Publication date: 15 May 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

tree-decompositiontransductionmonadic second order logicgraphs of bounded tree-width

Mathematics Subject Classification ID

Related Items (17)

Trees, grids, and MSO decidability: from graphs to matroids ⋮ Towards a language theory for infinite N-free pomsets. ⋮ Fixed-Parameter Tractability of Treewidth and Pathwidth ⋮ Recognizability equals definability for graphs of bounded treewidth and bounded chordality ⋮ Matroid tree-width ⋮ Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees ⋮ On self-duality of branchwidth in graphs of bounded genus ⋮ A monadic second-order definition of the structure of convex hypergraphs. ⋮ The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs ⋮ GETGRATS ⋮ The monadic second-order logic of graphs. XV: On a conjecture by D. Seese ⋮ Recognizability, hypergraph operations, and logical types ⋮ Measuring what matters: a hybrid approach to dynamic programming with treewidth ⋮ Causality in Bounded Petri Nets is MSO Definable ⋮ The recognizability of sets of graphs is a robust property ⋮ Uniform and nonuniform recognizability. ⋮ Rationality in algebras with a series operation

This page was built for publication: