J. Braquelaire and L. Brun, Image Segmentation with Topological Maps and Inter-pixel Representation, Journal of Visual Communication and Image Representation, vol.9, issue.1, pp.62-79, 1998.
DOI : 10.1006/jvci.1998.0374

E. Brisson, Representing geometric structures in d dimensions: topology and order, SCG, pp.218-227, 1989.

Y. Chi, R. R. Muntz, S. Nijssen, and J. N. Kok, Frequent subtree mining -an overview, Fundam. Inf, vol.66, pp.161-198, 2004.

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

G. Damiand, Topological model for 3D image representation: Definition and incremental extraction algorithm, Computer Vision and Image Understanding, vol.109, issue.3, pp.260-289, 2008.
DOI : 10.1016/j.cviu.2007.09.007
URL : https://hal.archives-ouvertes.fr/hal-00257372

G. Damiand, Y. Bertrand, and C. Fiorio, Topological model for two-dimensional image representation: definition and optimal extraction algorithm, Computer Vision and Image Understanding, vol.93, issue.2, pp.111-154, 2004.
DOI : 10.1016/j.cviu.2003.09.001
URL : https://hal.archives-ouvertes.fr/lirmm-00137917

G. Damiand, C. De-la-higuera, J. Janodet, E. Samuel, and C. Solnon, A Polynomial Algorithm for Submap Isomorphism, GbR), 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, 2011.
DOI : 10.1016/j.cviu.2010.12.013
URL : https://hal.archives-ouvertes.fr/hal-00597483

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

S. Gosselin, G. Damiand, and C. Solnon, Efficient search of combinatorial maps using signatures, Theoretical Computer Science Issues in Image Analysis and Processing, pp.1392-1405, 2011.
DOI : 10.1016/j.tcs.2010.10.029
URL : https://hal.archives-ouvertes.fr/hal-00567332

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, pp.197-206, 2006.
DOI : 10.1145/1150402.1150427

A. Jacques, Constellations et graphes topologiques, Combinatorial Theory and Applications, pp.657-673, 1970.

M. Kuramochi and G. Karypis, Frequent subgraph discovery. Data Mining, p.313, 2001.

P. Lienhardt, -dimensional generalized maps, Proceedings of the fifth annual symposium on Computational geometry , SCG '89, pp.228-236, 1989.
DOI : 10.1145/73833.73859
URL : https://hal.archives-ouvertes.fr/hal-00909382

P. Lienhardt, Topological models for boundary representation: a comparison with n-dimensional generalized maps, Computer-Aided Design, vol.23, issue.11, pp.59-82, 1991.
DOI : 10.1016/0010-4485(91)90100-B

P. Lienhardt, N-dimensional generalized combinatorial maps and cellular quasimanifolds, IJCGA, vol.4, issue.3, pp.275-324, 1994.

L. Steven and . Salzberg, C4.5: Programs for machine learning by j. ross quinlan, Machine Learning, pp.235-240, 1993.

W. T. Tutte, A census of planar maps. Canad, J. Math, vol.15, pp.249-271, 1963.

X. Yan and J. Han, gspan: Graph-based substructure pattern mining, Proceedings of the 2002 IEEE International Conference on Data Mining, ICDM '02, p.721, 2002.