1. Alimonti, P., & Kann, V. (2000). Some APX-completeness results for cubic graphs. Theoretical Computer Science, 237, 123–134.
2. Amini, O., Peleg, D., Pérennes, S., Sau, I., & Saurabh, S. (2012). On the approximability of some degree-constrained subgraph problems. Discrete Applied Mathematics, 160, 1661–1679.
3. Balasundaram, B., Butenko, S., & Trukhanov, S. (2005). Novel approaches for analyzing biological networks. Journal of Combinatorial Optimization, 10, 23–39.
4. Chartrand, G., Kaugars, A., & Lick, D. R. (1972). Critically $$n$$-connected graphs. Proceedings of the American Mathematical Society, 32, 63–68.
5. Chen, Y. P., Liestman, A. L., & Liu, J. (2005). Clustering algorithms for ad hoc wireless networks. In Y. Pan & Y. Xiao (Eds.), Ad hoc and sensor networks, wireless networks and mobile computing (pp. 145–164). New York: Nova Science Publishers.