Definability equals recognizability for graphs of bounded treewidth (Q4635898): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2962996851 / rank | |||
Normal rank | |||
Revision as of 18:15, 19 March 2024
scientific article; zbMATH DE number 6863510
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
