Definability equals recognizability of partial 3-trees
From MaRDI portal
Recommendations
- Definability equals recognizability of partial 3-trees and k-connected partial k-trees
- Definability equals recognizability for graphs of bounded treewidth
- Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees
- Recognizability equals definability for partial k-paths
- Definability equals recognizability for k-outerplanar graphs
Cites work
- A linear time algorithm for finding tree-decompositions of small treewidth
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Complexity of Finding Embeddings in a k-Tree
- Easy problems for tree-decomposable graphs
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Forbidden minors characterization of partial 3-trees
- Graph minors. II. Algorithmic aspects of tree-width
- Graph minors. XX: Wagner's conjecture
- scientific article; zbMATH DE number 3854429 (Why is no real title available?)
- scientific article; zbMATH DE number 4060712 (Why is no real title available?)
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Linear-time computability of combinatorial problems on series-parallel graphs
- Linear-time computation of optimal subgraphs of decomposable graphs
- Regularity and locality in \(k\)-terminal graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
This page was built for publication: Definability equals recognizability of partial 3-trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550548)
