Complexity of Domination in Triangulated Plane Graphs
classification
💻 cs.CC
math.CO
keywords
dominationnumberplanetriangulatedcomplexitydeterminegraphgraphs
read the original abstract
We prove that for a triangulated plane graph it is NP-complete to determine its domination number and its power domination number.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.