NP-Completeness of the Independent Dominating Set Problem in the Class of Cubic Planar Bipartite Graphs
Ya. A. Loverov, Yu. L. Orlovich · Journal of Applied and Industrial Mathematics · 2020
Abstract It is known that the independent dominating set problem is NP-complete both in the class of cubic planar graphs and in the class of cubic bipartite graphs. Still open is the question about the computational complexity of the problem in the intersection of these graph classes. In this article, we prove that the independent dominating set problem is NP-complete in the class of cubic planar bipartite graphs.