N. Beldiceanu, M. Carlsson, S. Demassey, and T. Petit, Graph properties based filte- ring, 2006.

N. Beldiceanu, M. Carlsson, and T. Petit, Deriving Filtering Algorithms from Constraint Checkers, Principles and Practice of Constraint Programming, pp.107-122, 2004.
DOI : 10.1007/978-3-540-30201-8_11

N. Beldiceanu, M. Carlsson, and J. Rampon, Global constraint catalog, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00485396

N. Beldiceanu, M. Carlsson, J. Rampon, and C. Truchet, Graph Invariants as Necessary Conditions for Global Constraints, Principles and Practice of Constraint Programming (CP'2005), pp.92-106
DOI : 10.1007/11564751_10

N. Beldiceanu, I. Katriel, and X. Lorca, Undirected Forest Constraints, CP-AI-OR'06, pp.29-43, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00481471

N. Beldiceanu, T. Petit, and G. Rochart, Bounds of Graph Characteristics, LNCS, vol.3709, pp.742-746, 2005.
DOI : 10.1007/11564751_56

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

M. R. Garey and D. S. Johnson, Computers and Intractability. A Guide to the Theory of NP- Completeness, 1979.

P. Martin and D. B. Shmoys, A new approach to computing optimal schedules for the job-shop scheduling problem, IPCO'96, pp.389-403, 1996.
DOI : 10.1007/3-540-61310-2_29

S. Micali and V. V. Vazirani, An O( |V | · |E|) algorithm for finding maximum matching in general graphs, FOCS 1980, pp.17-27, 1980.

G. Pesant, A Filtering Algorithm for the Stretch Constraint, LNCS, vol.2239, pp.183-195, 2001.
DOI : 10.1007/3-540-45578-7_13

J. Régin, The Symmetric alldiff Constraint, 16th Int. Joint Conf. on Artificial Intelligence (IJCAI- 99), pp.420-425, 1999.