Complexity of Domination in Triangulated Plane Graphs
arXiv:1709.00596
Abstract
We prove that for a triangulated plane graph it is NP-complete to determine its domination number and its power domination number.
arXiv:1709.00596
We prove that for a triangulated plane graph it is NP-complete to determine its domination number and its power domination number.