Before revision:  We also discuss the extensions of our construction to other problems and other classes of graphs, including 5-regular  planar graphs.
After revision:  We expand our method to show that it helps to provide lower bounds for other covering problems such as vertex cover and clique. We utilize the construction to show the NP-hardness of MIS on 5-regular planar graphs.