N. Beldiceanu, P. Flener, and X. Lorca, The tree Constraint, Proceedings of CP-AI-OR'05, volume LNCS 3524, 2005.
DOI : 10.1007/11493853_7
URL : https://hal.archives-ouvertes.fr/hal-00445174

H. Cambazard and E. Bourreau, Conception d'une constrainte globale de chemin, 10e Journ. nat. sur la résolution de problèmes NPcomplets, pp.107-121, 2004.

C. M. Ronay-dougal, I. P. Gent, T. Kelsey, and S. Linton, Tractable symmetry breaking in using restricted search trees, 2004.

D. Cohen, P. Jeavons, C. Jefferson, K. E. Petrie, and B. M. Smith, Symmetry definitions for constraint satisfaction problems, pp.17-31

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

J. Crawford, M. Ginsberg, E. Luks, and A. Roy, Symmetry breaking predicates for search problem, Proceedings of KR'96, 1996.

Y. Deville, G. Dooms, S. Zampelli, and P. Dupont, Cp(graph+map) for approximate graph matching, 1st International Workshop on Constraint Programming Beyond Finite Integer Domains, CP2005, 2005.

G. Dooms, Y. Deville, and P. Dupont, CP(Graph): Introducing a Graph Computation Domain in Constraint Programming, Principles and Pratice of Constraint Programming, 2005.
DOI : 10.1007/11564751_18

I. P. Gent, T. Kelsey, S. Linton, and C. Roney, Symmetry and Consistency, van Beek [27], pp.271-285
DOI : 10.1007/11564751_22

I. P. Gent, T. Kelsey, S. A. Linton, I. Mc-donald, I. Miguel et al., Conditional Symmetry Breaking, pp.256-270
DOI : 10.1007/11564751_21

I. P. Gent, A symmetry breaking constraint for indistinguishable values, Proceedings of CP'01, SymCon'01 Workshop, 2001.

I. P. Gent, W. Harvey, and T. Kelsey, Groups and Constraints: Symmetry Breaking during Search, Proceedings of CP'02, pp.415-430, 2002.
DOI : 10.1007/3-540-46135-3_28

I. P. Gent, W. Harvey, and T. Kelsey, Generic SBDD Using Computational Group Theory, Proceedings of CP'03, pp.333-346, 2003.
DOI : 10.1007/978-3-540-45193-8_23

I. P. Gent and B. M. Smith, Symmetry breaking during search in constraint programming, Proceedings of CP'01, pp.599-603, 2001.

J. Larrosa and G. Valiente, Constraint satisfaction algorithms for graph pattern matching, Mathematical Structures in Computer Science, vol.12, issue.04, pp.403-422, 2002.
DOI : 10.1017/S0960129501003577

N. Mamoulis and K. Stergiou, Constraint Satisfaction in Semi-structured Data Graphs, Lecture Notes in Computer Science, vol.3258, pp.393-407, 2004.
DOI : 10.1007/978-3-540-30201-8_30

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

P. Meseguer and C. Torras, Exploiting symmetries within constraint satisfaction search??????This paper is an extended and updated version of [16], presented at the IJCAI-99 conference., Artificial Intelligence, vol.129, issue.1-2, pp.133-163, 2001.
DOI : 10.1016/S0004-3702(01)00104-7

J. Puget, Symmetry Breaking Using Stabilizers, Proceedings of CP'03, pp.585-599, 2003.
DOI : 10.1007/978-3-540-45193-8_40

J. Puget, Breaking All Value Symmetries in Surjection Problems, Proceedings of CP'05, pp.490-504, 2005.
DOI : 10.1007/11564751_37

J. Puget, Elimination des symétries dans les problèmes injectifs, Proceedings des Journées Francophones de la Programmation par Contraintes, 2005.

J. Puget, Automatic Detection of Variable and Value Symmetries, van Beek, pp.477-489
DOI : 10.1007/11564751_36

J. Regin, A filtering algorithm for constraints of difference in CSPs, Proc. 12th Conf

M. Rudolf, Utilizing Constraint Satisfaction Techniques for Efficient Graph Pattern Matching, Proc. of the 9th International Conference on Principles and Pratice of Constraint Programming (CP)., volume LNCS 2833, pp.238-251, 1998.
DOI : 10.1007/978-3-540-46464-8_17

B. Smith, Reducing symmetry in a combinatorial design problem, Proc. CP-AI-OR'01, 3rd Int. Workshop on Integration of AI and OR Techniques in CP, 2001.

. Peter-van-beek, Principles and Practice of Constraint Programming -CP, 11th International Conference Proceedings, 2005.

S. Zampelli, Y. Deville, and P. Dupont, Approximate Constrained Subgraph Matching, Principles and Pratice of Constraint Programming, 2005.
DOI : 10.1007/11564751_74