scientific article
From MaRDI portal
Publication:3796771
zbMath0651.68079MaRDI QIDQ3796771
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
NP-completechromatic indexpolynomial timegraph isomorphismtree-decompositionspartial k-treesgraphs with small treewidth
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Canonical representations of partial 2-and 3-trees, The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues, NC-algorithms for graphs with small treewidth, On minimum dominating sets with minimum intersection, Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families, Canonical representations of partial 2- and 3-trees, On the complexity of finding iso- and other morphisms for partial \(k\)- trees
