K, P. , T., H.. "Connected Vertex Cover in 2-Connected Planar Graph with Maximum Degree 4 is NP-complete". World Academy of Science, Engineering and Technology, Open Science Index 11, International Journal of Mathematical and Computational Sciences (2007), 1(11), 570 - 573.