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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
