A. V. Aho, J. E. Hopcroft, and J. D. Ullman, Analysis of Computer algorithms, 1974.

G. E. Andrews, The theory of partitions Chapter 4: Compositions and Simon Newcomb's problem, 1976.

V. Arvind, B. Das, and P. Mukhopadhyay, On isomorphism and canonization of tournaments and hypertournaments, 17th International Symposium of Algorithms and Computation (ISAAC), pp.449-459, 2006.

L. Babai and E. M. Luks, Canonical labeling of graphs, Proceedings of the fifteenth annual ACM symposium on Theory of computing , STOC '83, pp.171-183, 1983.
DOI : 10.1145/800061.808746

J. Bang-jensen and G. Gutin, Digraphs: Theory, Algorithms and Applications, 2001.
DOI : 10.1007/978-1-84800-998-1

A. E. Brouwer, The enumeration of locally transitive tournaments, 1980.

B. Bui-xuan, M. Habib, V. Limouzy, and F. De-montgolfier, Algorithmic aspects of a general modular decomposition theory, Special issue of Discrete Applied Mathematics for the 3rd conference on Optimal Discrete Structures and Algorithms (ODSA'06), 2006.
DOI : 10.1016/j.dam.2008.11.001

URL : https://hal.archives-ouvertes.fr/hal-00111235

B. Bui-xuan, M. Habib, V. Limouzy, and F. De-montgolfier, Homogeneity vs. adjacency: generalising some graph decomposition algorithms, 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2006.
URL : https://hal.archives-ouvertes.fr/hal-00020188

M. Chein, M. Habib, and M. C. Maurer, Partitive hypergraphs, Discrete Mathematics, vol.37, issue.1, pp.35-50, 1981.
DOI : 10.1016/0012-365X(81)90138-2

E. Clarou, Une hiérarchie de forçage pour les tournois indécomposables, 1996.

D. A. Cohen, M. C. Cooper, and P. G. Jeavons, Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphisms, Theoretical Computer Science, vol.401, issue.1-3, 2006.
DOI : 10.1016/j.tcs.2008.03.015

URL : http://doi.org/10.1016/j.tcs.2008.03.015

C. J. Colbourn and D. G. , On deciding switching equivalence of graphs, Discrete Applied Mathematics, vol.2, issue.3, pp.181-184, 1980.
DOI : 10.1016/0166-218X(80)90038-4

W. H. Cunningham, A combinatorial decomposition theory, Journal canadien de math??matiques, vol.32, issue.3, 1973.
DOI : 10.4153/CJM-1980-057-7

A. Ehrenfeucht, T. Harju, and G. Rozenberg, The Theory of 2-Structures-A Framework for Decomposition and Transformation of Graphs, World Scientific, 1999.

A. Ehrenfeucht and G. Rozenberg, Theory of 2-structures, Theoretical Computer Science, vol.3, issue.70, pp.277-342, 1990.

A. Ehrenfreucht, H. N. Gabow, R. M. Mcconnell, and S. J. Sullivan, An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs, Journal of Algorithms, vol.16, issue.2, pp.283-294, 1994.
DOI : 10.1006/jagm.1994.1013

M. G. Everett and S. P. Borgatti, Role colouring a graph, Mathematical Social Sciences, vol.21, issue.2, pp.183-188, 1991.
DOI : 10.1016/0165-4896(91)90080-B

J. Fiala and D. Paulusma, The Computational Complexity of the Role Assignment Problem, 30th International Colloquium on Automata, Languages and Programming (ICALP), pp.817-828, 2003.
DOI : 10.1007/3-540-45061-0_64

H. N. Gabow, A representation for crossing set families with applications to submodular flow problems, Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.202-211, 1993.

H. N. Gabow, Centroids, Representations, and Submodular Flows, Journal of Algorithms, vol.18, issue.3, pp.586-628, 1995.
DOI : 10.1006/jagm.1995.1022

J. Gagneur, R. Krause, T. Bouwmeester, and G. Casari, Modular decomposition of protein-protein interaction networks, Genome Biology, vol.5, issue.8, 2004.

T. Gallai, Transitiv orientierbare Graphen, Acta Mathematica Academiae Scientiarum Hungaricae, vol.51, issue.1-2, pp.25-66, 1967.
DOI : 10.1007/BF02020961

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

M. Habib and M. C. Maurer, 1-Intersecting families, Discrete Mathematics, vol.53, pp.91-101, 1985.
DOI : 10.1016/0012-365X(85)90132-3

R. B. Hayward, RecognizingP3-Structure: A Switching Approach, Journal of Combinatorial Theory, Series B, vol.66, issue.2, pp.247-262, 1996.
DOI : 10.1006/jctb.1996.0018

A. Hertz, On perfect switching classes, Discrete Applied Mathematics, vol.94, issue.1-3, pp.3-7, 1999.
DOI : 10.1016/S0166-218X(98)00153-X

W. Hsu and R. M. Mcconnell, PC trees and circular-ones arrangements, Theoretical Computer Science, vol.296, issue.1, pp.99-116, 2003.
DOI : 10.1016/S0304-3975(02)00435-8

J. Kratochvíl, J. Ne?et?il, and O. Z´ykaz´yka, On the Computational Complexity of Seidel's Switching, Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity (Prachatice, pp.161-166, 1990.
DOI : 10.1016/S0167-5060(08)70622-8

G. Lopez and C. Rauzy, RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n - 1) I, Zeitschrift f??r Mathematische Logik und Grundlagen der Mathematik, vol.1, issue.1, pp.27-37, 1992.
DOI : 10.1002/malq.19920380104

R. M. Mcconnell and F. De-montgolfier, Linear-time modular decomposition of directed graphs, Discrete Applied Mathematics, vol.145, issue.2, pp.189-209, 2005.
DOI : 10.1016/j.dam.2004.02.017

URL : https://hal.archives-ouvertes.fr/hal-00159571

R. H. Möhring and F. J. Radermacher, Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization, Annals of Discrete Mathematics, vol.19, pp.257-356, 1984.
DOI : 10.1016/S0304-0208(08)72966-9

F. De-montgolfier, Décomposition modulaire des graphes. Théorie, extensions et algorithmes, 2003.

F. De-montgolfier, M. Rao, and M. Rao, The bi-join decomposition Bipartitive families and the bi-join decomposition, ICGT '05, 7th International Colloquium on Graph Theory, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00132862

S. Oum, Graphs Of Bounded Rank Width, 2005.

S. Oum, Rank-width and vertex-minors, Journal of Combinatorial Theory, Series B, vol.95, issue.1, pp.79-100, 2005.
DOI : 10.1016/j.jctb.2005.03.003

A. Schrijver, Combinatorial Optimization -Polyhedra and Efficiency, 2003.

J. J. Seidel, A SURVEY OF TWO-GRAPHS, Colloquio Internazionale sulle Teorie Combinatorie Tomo I, pp.481-511, 1973.
DOI : 10.1016/B978-0-12-189420-7.50018-9

N. J. Sloane, The On-Line Encyclopedia of Integer Sequences
DOI : 10.1007/978-3-540-73086-6_12

E. Speckenmeyer, On feedback problems in digraphs, 15th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp.218-231, 1989.
DOI : 10.1007/3-540-52292-1_16

D. R. White and K. P. Reitz, Graph and semigroup homomorphisms on networks of relations, Social Networks, vol.5, issue.2, pp.193-234, 1983.
DOI : 10.1016/0378-8733(83)90025-4