Complexity of Domination in Triangulated Plane Graphs

09/02/2017

∙

by   Dömötör Pálvölgyi, et al.

∙

0

∙

share

We prove that for a triangulated plane graph it is NP-complete to determine its domination number and its power domination number.