Publication:3796771
From MaRDI portal
zbMath0651.68079MaRDI QIDQ3796771
Publication date: 1988
NP-complete; chromatic index; polynomial time; graph isomorphism; tree-decompositions; partial k-trees; graphs with small treewidth
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
Related Items
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, The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues