M. D. Santo, P. Foggia, C. Sansone, and M. Vento, A large database of graphs and its use for benchmarking graph isomorphism algorithms, Pattern Recognition Letters, vol.24, issue.8, pp.1067-1079, 2003.
DOI : 10.1016/S0167-8655(02)00253-2

K. Riesen and H. Bunke, IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning, Proc. 12th IAPR International Workshop on Structural and Syntactic Pattern Recognition, pp.287-297, 2008.
DOI : 10.1007/978-3-540-89689-0_33

D. Conte, P. Foggia, C. Sansone, and M. Vento, How and Why Pattern Recognition and Computer Vision Applications Use Graphs, pp.85-135, 2007.
DOI : 10.1007/978-3-540-68020-8_4

E. Samuel, C. De-la-higuera, and J. Janodet, Extracting Plane Graphs from Images, Proc Joint IAPR International Workshop on Structural, Syntactic , and Statistical Pattern Recognition (SSPR&SPR'10), pp.233-243, 2010.
DOI : 10.1007/978-3-642-14980-1_22
URL : https://hal.archives-ouvertes.fr/ujm-00531224

D. Conte, P. Foggia, C. Sansone, and M. Vento, THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITION, International Journal of Pattern Recognition and Artificial Intelligence, vol.18, issue.03, pp.265-298, 2004.
DOI : 10.1142/S0218001404003228
URL : https://hal.archives-ouvertes.fr/hal-01408706

B. Mckay, Practical graph isomorphism, II, Journal of Symbolic Computation, vol.60, pp.45-87, 1981.
DOI : 10.1016/j.jsc.2013.09.003

S. Zampelli, Y. Deville, C. Solnon, S. Sorlin, and P. Dupont, Filtering for Subgraph Isomorphism, Proc. 13th Principles and Practice of Constraint Programming, pp.728-742, 2007.
DOI : 10.1007/978-3-540-74970-7_51
URL : https://hal.archives-ouvertes.fr/hal-01502145

S. Sorlin and C. Solnon, A parametric filtering algorithm for the graph isomorphism problem, Constraints, vol.58, issue.1???3, pp.518-537, 2008.
DOI : 10.1007/s10601-008-9044-1
URL : https://hal.archives-ouvertes.fr/hal-01500328

L. P. Cordella, P. Foggia, C. Sansone, and M. Vento, An improved algorithm for matching large graphs, Proc. 3rd IAPR International Workshop on Graph-based Representations in Pattern Recognition (GbR'01), pp.149-159, 2001.

E. Fusy, Combinatoire des graphes planaires et applications algorithmiques, 2007.

R. Cori, Un code pour les graphes planaires et ses applications, 1975.

R. Cori, Computation of the Automorphism Group of a Topological Graph embedding, CNRSéquipeCNRSéquipe du laboratoire associé 226, 1985.

F. Dorn, Planar subgraph isomorphism revisited, Proc. 27th International Symposium on Theoretical Aspects of Computer Science (STACS'10), volume 5 of LIPIcs, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.263-274, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00455215

D. Eppstein, Subgraph Isomorphism in Planar Graphs and Related Problems, Journal of Graph Algorithms and Applications, vol.3, issue.3, pp.1-27, 1999.
DOI : 10.7155/jgaa.00014

T. B. Jones and S. Mitchel, Linear algorithms for isomorphism of maximal outerplanar graphs, Journal Association Computer Machine, vol.26, pp.603-610, 1979.

G. Damiand, C. De-la-higuera, J. Janodet, E. Samuel, and C. Solnon, A Polynomial Algorithm for Submap Isomorphism, Proceedings 7th IAPR Int. Workshop on Graphbased Representation in Pattern Recognition (GbR'09), pp.102-112, 2009.
DOI : 10.1007/978-3-540-74970-7_51

G. Damiand, C. Solnon, C. De-la-higuera, J. Janodet, and E. Samuel, Polynomial algorithms for subisomorphism of nD open combinatorial maps, Computer Vision and Image Understanding, vol.115, issue.7, pp.996-1010, 2011.
DOI : 10.1016/j.cviu.2010.12.013
URL : https://hal.archives-ouvertes.fr/hal-00597483

X. Jiang and H. Bunke, Marked subgraph isomorphism of ordered graphs, LNCS, vol.1451, pp.122-131, 1998.
DOI : 10.1007/BFb0033230

X. Jiang and H. Bunke, Optimal quadratic-time isomorphism of ordered graphs, Pattern Recognition, vol.32, issue.7, pp.1273-1283, 1999.
DOI : 10.1016/S0031-3203(98)00145-9

S. Russell and P. Norvig, Artificial Intelligence: A Modern Approach, 2010.

M. Poudret, A. Arnould, Y. Bertrand, and P. Lienhardt, Cartes Combinatoires Ouvertes, Research Notes 2007-1, Laboratoire SIC E.A. 4103, F-86962 Futuroscope Cedex -France, 2007.

T. Nishizeki and M. S. Rahman, Planar graph drawing, volume 12 of Lecture notes series on computing, 2004.

P. Lienhardt, N-DIMENSIONAL GENERALIZED COMBINATORIAL MAPS AND CELLULAR QUASI-MANIFOLDS, International Journal of Computational Geometry & Applications, vol.04, issue.03, pp.275-324, 1994.
DOI : 10.1142/S0218195994000173

K. Jansen and H. Müller, The minimum broadcast time problem for several processor networks, Theoretical Computer Science, vol.147, issue.1-2, pp.69-85, 1995.
DOI : 10.1016/0304-3975(94)00230-G