Definability equals recognizability for \(k\)-outerplanar graphs (Q5363771)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Definability equals recognizability for k-outerplanar graphs |
scientific article; zbMATH DE number 6784968
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9653403162956238
0 references
0.8621383905410767
0 references
0.8299521803855896
0 references
