L. Addario-berry, K. Dalal, and B. A. Reed, Degree constrained subgraphs, vol.156, pp.1168-1174, 2008.

O. Amini, D. Peleg, S. Pérennes, I. Sau, and S. Saurabh, Degree-Constrained Subgraph Problems: Hardness and Approximation Results, ALGO/WAOA 2008, vol.5426, pp.29-42, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00331747

O. Amini, S. Pérennes, and I. Sau, Hardness and Approximation of Traffic Grooming, Theoretical Computer Science, vol.410, pp.3751-3760, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00158341

O. Amini, I. Sau, and S. Saurabh, Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem, IWPEC 2008, vol.5018, pp.13-29, 2008.

B. S. Baker, Approximation Algorithms for NP-Complete Problems on Planar Graphs, Journal of the ACM, vol.41, issue.1, pp.153-180, 1994.

J. Bermond and C. Peyrat, Induced Subgraphs of the Power of a Cycle, SIAM Journal on Discrete Mathematics, vol.2, issue.4, pp.452-455, 1989.

B. Bollobás and G. Brightwell, Long Cycles in Graphs with no Subgraphs of Minimal Degree 3, Discrete Mathematics, vol.75, pp.47-53, 1989.

J. Cheriyan and R. Thurimella, Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching (extended abstract), Proc. of the 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp.292-301, 1996.

T. Chow and P. J. Lin, The ring grooming problem, Networks, vol.44, pp.194-202, 2004.

R. Diestel, Graph Theory, vol.173, 2005.

F. Dorn, Planar Subgraph Isomorphism Revisited, Proc. of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS). LIPIcs, vol.5, pp.263-274, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00455215

R. G. Downey and M. R. Fellows, Parameterized Complexity, 1999.

P. Erd?s, R. J. Faudree, A. Gyárfás, and R. H. Schelp, Cycles in Graphs Without Proper Subgraphs of Minimum Degree 3, Ars Combinatorica, vol.25, pp.195-201, 1988.

P. Erd?s, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Subgraphs of Minimal Degree k, Discrete Mathematics, vol.85, issue.1, pp.53-58, 1990.

H. N. Gabow, An Efficient Reduction Technique for Degree-Constrained Subgraph and Bidirected Network Flow Problems, Proc. of the 15th Annual ACM Symposium on Theory of Computing (STOC), pp.448-456, 1983.

M. R. Garey and D. S. Johnson, The Rectilinear Steiner Tree Problem is NP-Complete, SIAM Journal on Applied Mathematics, vol.32, issue.4, pp.826-834, 1977.

D. Karger, R. Motwani, and G. Ramkumar, On Approximating the Longest Path in a Graph, Algorithmica, vol.18, issue.1, pp.82-98, 1997.

A. Kézdy, Studies in Connectivity, 1991.

Z. Li and S. Nakano, Efficient generation of plane triangulations without repetitions, ICALP 2001, vol.2076, pp.433-443, 2001.

R. J. Lipton and R. E. Tarjan, A separator theorem for planar graphs, SIAM Journal on Applied Mathematics, vol.36, pp.177-189, 1979.

Z. Nutov, A. Goel, K. Jansen, and J. D. Rolim, Approximating Directed Weighted-Degree Constrained Networks, APPROX and RANDOM 2008, vol.5171, pp.219-232, 2008.

D. Peleg, I. Sau, and M. Shalom, On approximating the d-girth of a graph (manuscript)

M. Safari and M. R. Salavatipour, A Constant Factor Approximation for Minimum ?-Edge-Connected k-Subgraph with Metric Costs, APPROX and RANDOM 2008, vol.5171, pp.233-246, 2008.

W. T. Tutte, A census of planar triangulations, Canadian Journal of Mathematics, vol.14, pp.21-38, 1962.