Definability equals recognizability for $k$ -outerplanar graphs and $l$ -chordal partial $k$ -trees

Authors:

Publisher website

1 December 2017

journal article
Published by Elsevier in European Journal of Combinatorics

Vol. 66, 191-234
DOI:10.1016/j.ejc.2017.06.025

Abstract

No abstract available

Keywords

Funding Information

Dutch Ministry of Education, Culture and Science

This publication has 19 references indexed in Scilit:

Myhill–Nerode Methods for Hypergraphs
Algorithmica, 2015
Safe separators for treewidth
Discrete Mathematics, 2006
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science, 1998
The monadic second order logic of graphs VI: on several representations of graphs by relational structures
Discrete Applied Mathematics, 1994
Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
Algorithmica, 1992
Easy problems for tree-decomposable graphs
Journal of Algorithms, 1991
The monadic second-order logic of graphs V: on closing the gap between definability and recognizability
Theoretical Computer Science, 1991
The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
Information and Computation, 1990
Trees in Polyhedral Graphs
Canadian Journal of Mathematics, 1966
Weak Second‐Order Arithmetic and Finite Automata
Mathematical Logic Quarterly, 1960