Definability equals recognizability of partial 3-trees and \(k\)-connected partial \(k\)-trees (Q1578419)
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 of partial 3-trees and \(k\)-connected partial \(k\)-trees |
scientific article; zbMATH DE number 1496850
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Definability equals recognizability of partial 3-trees and \(k\)-connected partial \(k\)-trees |
scientific article; zbMATH DE number 1496850 |
Statements
Definability equals recognizability of partial 3-trees and \(k\)-connected partial \(k\)-trees (English)
0 references
27 August 2000
0 references
graph decision problems
0 references
tree automaton
0 references
