Y. Chi, R. Muntz, S. Nijssen, and J. Kok, Frequent subtree mining: an overview, Fundamenta Informaticae, vol.66, pp.161-198, 2005.

G. Damiand, C. De-la-higuera, J. Janodet, E. Samuel, and C. Solnon, A Polynomial Algorithm for Submap Isomorphism, GbRPR'09, pp.102-112, 2009.
DOI : 10.1007/978-3-540-74970-7_51

J. Edmonds, A combinatorial representation for polyhedral surfaces. Notices of the, 1960.

F. `-ary and I. , On straight-line representation of planar graphs, Acta Scientiarum Mathematicarum, vol.11, pp.229-233, 1948.

T. Horvath and J. Ramon, Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth, PKDD'08, pp.520-535, 2008.
DOI : 10.1007/978-3-540-87479-9_52

T. Horvath, J. Ramon, and S. Wrobel, Frequent subgraph mining in outerplanar graphs, Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '06, 2006.
DOI : 10.1145/1150402.1150427

B. Luo, R. C. Wilson, and E. R. Hancock, Spectral embedding of graphs, Pattern Recognition, vol.36, issue.10, pp.2213-2230, 2003.
DOI : 10.1016/S0031-3203(03)00084-0

W. T. Tutte, A census of planar maps, Journal canadien de math??matiques, vol.15, issue.0, pp.249-271, 1963.
DOI : 10.4153/CJM-1963-029-x