1. Appa, G., Magos, D., Mourtos, I. (2004). Linear programming relaxations of multiple all-different predicates. In J. C. Régin, M. Rueher (Eds.), Integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CPAIOR 2004). Lecture notes in computer science (Vol. 3011, pp. 364–369). Springer.
2. Appa, G., Magos, D., Mourtos, I. (2004). On the system of two all-different predicates. Information Processing Letters, 94, 99–105.
3. Bergman, D., & Hooker, J.N. (2012). Graph coloring facets from all-different systems. In N. Jussien, T. Petit (Eds.), Proceedings of the international workshop on integration of artificial intelligence and operations research techniques in constraint programming for combintaorial optimization problems. CPAIOR: Springer (to appear).
4. Coll, P., Marenco, J., Méndez-Díaz, I., Zabala, P. (2002). Facets of the graph coloring polytope. Annals of Operations Research, 116, 79–90.
5. Genç-Kaya, L., & Hooker, J.N. (2010). The circuit polytope. Manuscript, Carnegie Mellon University.