English

Complexity of Domination in Triangulated Plane Graphs

Computational Complexity 2017-09-05 v1 Combinatorics

Abstract

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

Keywords

Cite

@article{arxiv.1709.00596,
  title  = {Complexity of Domination in Triangulated Plane Graphs},
  author = {Dömötör Pálvölgyi},
  journal= {arXiv preprint arXiv:1709.00596},
  year   = {2017}
}
R2 v1 2026-06-22T21:31:24.457Z