Definability equals recognizability for graphs of bounded treewidth (Q4635898)
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 graphs of bounded treewidth |
scientific article; zbMATH DE number 6863510
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Definability equals recognizability for graphs of bounded treewidth |
scientific article; zbMATH DE number 6863510 |
Statements
Definability equals recognizability for graphs of bounded treewidth (English)
0 references
23 April 2018
0 references
monadic second-order logic
0 references
Simon's factorization forest
0 references
recognizability
0 references
tree decomposition
0 references
treewidth
0 references
0.9709221
0 references
0.9493723
0 references
0.91607535
0 references
0.9089582
0 references
0.9021471
0 references
0 references
0.8930167
0 references
