M. O. Albertson and D. M. Berman, A conjecture on planar graphs, Graph Theory and Related Topics, p.357, 1979.

]. N. Alo03 and . Alon, Problems and results in extremal combinatorics I, Discrete Math, vol.273, pp.31-53, 2003.

D. [. Alon, R. Mubayi, and . Thomas, Large induced forests in sparse graphs, Journal of Graph Theory, vol.46, issue.3, pp.113-123, 2001.
DOI : 10.1002/jgt.1028

J. Akiyama and M. Watanabe, Maximum induced forests of planar graphs, Graphs and Combinatorics, vol.3, issue.1, pp.201-202, 1987.
DOI : 10.1007/BF01788541

M. [. Erd?-os, V. T. Saks, and . Sós, Maximum induced trees in graphs, Journal of Combinatorial Theory, Series B, vol.41, issue.1, pp.61-79, 1986.
DOI : 10.1016/0095-8956(86)90028-6

J. Fox, P. S. Loh, and B. Sudakov, Large induced trees in <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:msub><mml:mi>K</mml:mi><mml:mi>r</mml:mi></mml:msub></mml:math>-free graphs, Journal of Combinatorial Theory, Series B, vol.99, issue.2, pp.494-501, 2009.
DOI : 10.1016/j.jctb.2008.10.001

]. R. Kar72 and . Karp, Reducibility among combinatorial problems, Complexity of Computer Computations, pp.85-103, 1972.

R. [. Matou?ek and . Sámal, Induced trees in triangle-free graphs, Electronic Notes in Discrete Mathematics, vol.29, pp.7-14, 2008.
DOI : 10.1016/j.endm.2007.07.053

N. Punnim, The decycling number of regular graphs, Thai J. Math, vol.4, pp.145-161, 2008.

M. R. Salavatipour, Large Induced Forests in Triangle-Free Planar Graphs, Graphs and Combinatorics, vol.22, issue.1, pp.113-126, 2006.
DOI : 10.1007/s00373-006-0642-7