Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees (Q2403697)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees |
scientific article |
Statements
Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees (English)
0 references
11 September 2017
0 references
\(l\)-chordal partial \(k\)-trees
0 references
definability
0 references
Courcelle's conjecture
0 references
0 references
0 references
0 references
0 references
0 references
