Complexity of Domination in Triangulated Plane Graphs

09/02/2017
by   Dömötör Pálvölgyi, et al.
0

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

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset