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.

中文翻译：

---

一类三次平面二部图的独立控制集问题的NP完备性

摘要

众所周知，在三次平面图类和三次二部图类中，独立控制集问题都是NP完全的。在这些图类的交集中，有关该问题的计算复杂性的问题仍然是未解决的。在本文中，我们证明了三次平面二部图类中的独立控制集问题是NP完全的。