N. Alon, J. Kahn, and P. D. Seymour, Large induced degenerate subgraphs, Graphs and Combi, pp.203-211, 1987.
DOI : 10.1007/bf01788542
URL : http://www.cs.tau.ac.il/~nogaa/PDFS/Publications/Large induced degenerate subgraphs in graphs.pdf

N. Alon, D. Mubayi, and R. Thomas, Large induced forests in sparse graphs, Journal of Graph Theory, vol.46, issue.3, pp.113-123, 2001.
DOI : 10.1016/0012-365X(83)90273-X

L. D. Andersen, The strong chromatic index of a cubic graph is at most 10, Discrete Mathematics, vol.108, issue.1-3, pp.108-231, 1992.
DOI : 10.1016/0012-365X(92)90678-9

S. Bau and L. W. Beineke, The decycling number of graphs, Australasian Journal of Combinatorics, vol.284, pp.25-285, 2002.

H. L. Bodlaender, A. M. Koster, ]. W. Goddard, S. M. Hedetniemi, S. T. Hedetniemi et al., Combinatorial Optimization on Graphs of Bounded Generalized subgraph-restricted 301 matchings in graphs, Discrete Mathematics, vol.15, pp.293-129, 2005.

M. A. Henning and D. Rautenbach, Induced matchings in subcubic graphs without short cycles, Discrete Mathematics, vol.315, issue.316, p.305
DOI : 10.1016/j.disc.2013.10.009

R. J. Kang, M. Mnich, and T. Müller, Induced matchings in subcubic planar graphs, SIAM Journal 311 on Discrete Mathematics, vol.26, pp.310-1383, 2012.
DOI : 10.1007/978-3-642-15781-3_10

]. D. Kratsch, H. Müller, and I. Todinca, Feedback vertex set on AT-free graphs, Discrete Applied 313, Liang, On the feedback vertex set problem in permutation graphs, Information Processing 315 Letters 52, pp.312-1936, 1994.
DOI : 10.1016/j.dam.2007.10.006
URL : https://doi.org/10.1016/j.dam.2007.10.006