J. B?asiok, M. Kami?ski, and J. Raymond, Théophile Trunck, Induced minors and well-quasi-ordering. ArXiv e-prints, 2015.

P. Damaschke, Induced subgraphs and well-quasi-ordering, Journal of Graph Theory, vol.59, issue.4, pp.427-435, 1990.
DOI : 10.1002/jgt.3190140406

G. Ding, Subgraphs and well-quasi-ordering, Journal of Graph Theory, vol.2, issue.5, pp.489-502, 1992.
DOI : 10.1002/jgt.3190160509

R. Michael, D. Fellows, F. A. Hermelin, and . Rosamond, Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications, Algorithmica, vol.64, issue.1, pp.3-18, 2012.

G. Higman, Ordering by Divisibility in Abstract Algebras, Proc. Lond. Math. Soc, pp.3-5, 1952.
DOI : 10.1112/plms/s3-2.1.326

M. Kami?ski, J. Raymond, and T. Trunck, Multigraphs without large bonds are well-quasi-ordered by contraction ArXiv e-prints, 2014.

J. B. Kruskal, Well-quasi-ordering, the tree theorem, and Vazsonyi's conjecture, Trans. Amer. Math. Soc, pp.95-210, 1960.
DOI : 10.2307/1993287

C. Liu, Graph Structures and Well-Quasi-Ordering, Georgia Tech, 2014.

C. J. St and . Nash-williams, On well-quasi-ordering finite trees, Proc. Cambridge Philos. Soc. 59, pp.833-835, 1963.

N. Robertson and P. D. Seymour, Graph Minors. XX. Wagner's conjecture, Journal of Combinatorial Theory, Series B, vol.92, issue.2, pp.325-357, 2004.
DOI : 10.1016/j.jctb.2004.08.001

N. Robertson and P. D. Seymour, Graph minors XXIII. Nash-Williams' immersion conjecture, Journal of Combinatorial Theory, Series B, vol.100, issue.2, pp.181-205, 2010.
DOI : 10.1016/j.jctb.2009.07.003