Examples Well-quasi-ordering

^ gasarch, w. (1998), survey of recursive combinatorics , handbook of recursive mathematics, vol. 2, stud. logic found. math., 139, amsterdam: north-holland, pp. 1041–1176, doi:10.1016/s0049-237x(98)80049-9, mr 1673598 . see in particular page 1160.
^ nešetřil, jaroslav; ossona de mendez, patrice (2012), lemma 6.13 , sparsity: graphs, structures, , algorithms, algorithms , combinatorics, 28, heidelberg: springer, p. 137, doi:10.1007/978-3-642-27875-4, isbn 978-3-642-27874-7, mr 2920058 .
^ damaschke, peter (1990), induced subgraphs , well-quasi-ordering , journal of graph theory, 14 (4): 427–435, doi:10.1002/jgt.3190140406, mr 1067237 .