Paper Info
Title
Complexity of domination in triangulated plane graphs
Abstract
We prove that for a triangulated plane graph it is NP-complete to determine its domination number and its power domination number.
Year
DOI
Venue
2017
10.2478/ausi-2019-0012
ACTA UNIVERSITATIS SAPIENTIAE INFORMATICA
Keywords
DocType
Volume
NP-completeness,planar graphs,domination
Journal
11
Issue
ISSN
Citations 
2
1844-6086
0
PageRank 
References 
Authors
0.34
0
1
Name
Order
Citations
PageRank
Dömötör Pálvölgyi120229.14