Hi,
I believe it is just an easy question, but I have not found the answer: Is the optimization / decision problem DOMINATING SET NPcomplete when restricted to regular graphs? Where can I find a proof of that?
Thank you, MO users.
Hi, I believe it is just an easy question, but I have not found the answer: Is the optimization / decision problem DOMINATING SET NPcomplete when restricted to regular graphs? Where can I find a proof of that? Thank you, MO users. 


Dominating set is NPcomplete, and even APXcomplete, for cubic graphs. dx.doi.org/10.1016/S03043975(98)001583 – Andrew D. King Thank you very much, Andrew D. King. I also found that it is NPcomplete even for planar 4regular graphs. – Martin Manrique 

