scientific article; zbMATH DE number 861309

zbMath0843.05060MaRDI QIDQ4871033

Stephen T. Hedetniemi, Aniket Majumdar, Sandra M. Hedetniemi, Alice A. McRae, Renu C. Laskar

Publication date: 21 May 1996

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

zbMATH Keywords

surveyindependenceNP-completenessline graphdominationirredundancetotal graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Using maximality and minimality conditions to construct inequality chains ⋮ The algorithmic complexity of mixed domination in graphs ⋮ Improved parameterized algorithms and kernels for mixed domination ⋮ On the algorithmic complexity of twelve covering and independence parameters of graphs

This page was built for publication: