1. Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures;Schmerl;Discrete Mathematics,1993
2. Primitive 2-structures with the (n−2)-property;Bonizzoni;Theoretical Computer Science,1994
3. L’intervalle en théorie des relations, ses généralizations, filtre intervallire et clôture d’une relation;Fraïssé,1984
4. A fast algorithm for the decomposition of graphs and posets;Mohring;Mathematics of Operations Research,1983
5. M. Habib, Substitution des structures combinatoires, théorie et algorithmes, Ph.D. Thesis, Université Pierre et Marie Curie, Paris VI