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

R. Diestel, Graph theory, Graduate Texts in Mathematics, 2005.

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

G. Ding, Chordal graphs, interval graphs, and wqo, Journal of Graph Theory, vol.28, issue.2, pp.105-114, 1998.
DOI : 10.1002/(SICI)1097-0118(199806)28:2<105::AID-JGT4>3.0.CO;2-P

G. Ding, On canonical antichains, Discrete Mathematics, vol.309, issue.5, pp.1123-1134, 2009.
DOI : 10.1016/j.disc.2007.12.018

R. Michael, D. Fellows, F. A. Hermelin, and R. , Well-quasiordering bounded treewidth graphs, Proceedings of IWPEC, 2009.

G. Higman, Ordering by divisibility in abstract algebras Proceedings of the, pp.3-2326, 1952.

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

C. J. St and . Nash-williams, On well-quasi-ordering finite trees, Proceedings of the Cambridge Philosopical Society, pp.833-835, 1963.

B. Oporowski, J. Oxley, and R. Thomas, Typical Subgraphs of 3- and 4-Connected Graphs, Journal of Combinatorial Theory, Series B, vol.57, issue.2, pp.239-257, 1993.
DOI : 10.1006/jctb.1993.1019

N. Robertson and P. 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

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

W. T. Tutte, A theory of 3-connected graphs, Indagationes Mathematicae (Proceedings), vol.64, pp.441-455, 1961.
DOI : 10.1016/S1385-7258(61)50045-5