Definability Equals Recognizability for $k$-Outerplanar Graphs (Q5363771)
From MaRDI portal
scientific article; zbMATH DE number 6784968
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Definability Equals Recognizability for $k$-Outerplanar Graphs |
scientific article; zbMATH DE number 6784968 |
Statements
29 September 2017
0 references
treewidth
0 references
monadic second-order logic of graphs
0 references
finite-state tree automata
0 references
\(k\)-outerplanar graphs
0 references
cs.LO
0 references
math.CO
0 references
Definability equals recognizability for $k$-outerplanar graphs (English)
0 references
