scientific article

zbMath0673.05081MaRDI QIDQ3826618

T. V. Wimer, Stephen T. Hedetniemi

Publication date: 1988

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

K-terminal graphK-terminal recursive families of graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (11)

Perfect edge domination and efficient edge domination in graphs ⋮ A recurrence template for several parameters in series-parallel graphs ⋮ Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs ⋮ Algorithms for recognition of regular properties and decomposition of recursive graph families ⋮ On domination and reinforcement numbers in trees ⋮ Canonical representations of partial 2- and 3-trees ⋮ Efficiently parallelizable problems on a class of decomposable graphs ⋮ On minimum cuts and the linear arrangement problem ⋮ Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph ⋮ A linear-time certifying algorithm for recognizing generalized series-parallel graphs ⋮ Efficient edge domination problems in graphs

This page was built for publication: