A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Massachusetts.
M.R. Garey, D.S. Johnson, Computers and Intractability. A Guide to the Theory of NP-completeness, Freeman, San Francisco.
F. Harary, Graph Theory, Addison-Wesley, Reading, Massachusetts.
J. Hopcroft, R.E. Tarjan, Isomorphism of planar graphs, Proc. 4th Ann. Symposium on Theory of Computing.
A. Lingas, Subgraph Isomorphism for Easily Separable Graphs of Bounded Valence, 11th Workshop on Graph-theoretic Concepts in Computer Science, Castle Schwanberg.
E.M. Luks, Isomorphism of bounded valence can be tested in polynomial time, in Proc. 21st Ann. Symposium of Foundations of Computer Science, IEEE.
D. W. Matula, Subtree isomorphism in O(n
5/2), Annals of Discrete Mathematics 2, 91–106.
G. Miller, Isomorphism testing for graphs of bounded genus, Proc. Ann. 12th ACM symposium on Theory of Computing.
S.L. Mitchell, Linear algorithms to recognize outerplanar and maximal outerplanar graphs, Inf. Proces. Let., vol. 9, no. 5.
D.M. Mount, Isomorphism of graphs with bounded eigenvalue multiplicity, manuscript, Purdue University.
S. W. Reyner, An analysis of a good algorithm for the subtree problem, SIAM J. Comput. 6, 730–732.
M.M. Sysło, The subgraph isomorphism problem for outerplanar graphs, Theoretical Computer Science 17, 91–97.
M.M. Sysło, Personal Communication, 1985.