Acerca de este artículo
Publicado en línea: 21 ene 2020
Páginas: 174 - 183
Recibido: 31 oct 2019
DOI: https://doi.org/10.2478/ausi-2019-0012
Palabras clave
© 2019 Dömötör Pálvölgyi, published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.
We prove that for a triangulated plane graph it is NP-complete to determine its domination number and its power domination number.