1. Finite automata, bounded treewidth and well-quasiordering;Abrahamson,1993
2. Islode Adler, Open problems related to computing obstruction sets. Manuscript, 2008.
3. Computing excluded minors;Adler,2008
4. A kuratowski theorem for the projective plane;Archdeacon;J. Graph Theory,2006
5. Forbidden minors characterization of partial 3-trees;Arnborg;Discrete Math.,1990