G. Turan, On the succinct representation of graphs, Discrete Applied Mathematics, vol.8, issue.3, pp.289-294, 1984.
DOI : 10.1016/0166-218X(84)90126-4

P. Boldi and S. Vigna, The webgraph framework I, Proceedings of the 13th conference on World Wide Web , WWW '04, pp.595-602, 2004.
DOI : 10.1145/988672.988752

P. Boldi and S. Vigna, Codes for the World Wide Web, Internet Mathematics, vol.2, issue.4, pp.407-429, 2005.
DOI : 10.1080/15427951.2005.10129113

P. Goldberg, M. Golumbic, H. Kaplan, and R. Shamir, Four Strikes Against Physical Mapping of DNA, Journal of Computational Biology, vol.2, issue.1, pp.139-152, 1995.
DOI : 10.1089/cmb.1995.2.139

C. Crespelle and P. Gambette, Efficient neighbourhood encoding for interval graphs and permutation graphs and O(n) breadth-first search, th International Workshop on Combinatorial Algorithms (IWOCA'09), no. 5874 in LNCS, pp.20-146, 2009.
URL : https://hal.archives-ouvertes.fr/lirmm-00415935

R. Wang, F. Lau, and Y. Zhao, Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices, Discrete Applied Mathematics, vol.155, issue.17, pp.2312-2320, 2007.
DOI : 10.1016/j.dam.2007.06.009

C. Gavoille and D. Peleg, The Compactness of Interval Routing, SIAM Journal on Discrete Mathematics, vol.12, issue.4, pp.459-473, 1999.
DOI : 10.1137/S0895480197328631

F. Roberts, Representations of indifference relations, 1968.

A. Ehrenfeucht and D. Haussler, Learning decision trees from random examples, Information and Computation, vol.82, issue.3, pp.231-246, 1989.
DOI : 10.1016/0890-5401(89)90001-1

URL : http://doi.org/10.1016/0890-5401(89)90001-1

R. Gavaldà and D. Thérien, Algebraic Characterizations of Small Classes of Boolean Functions, Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS'03), pp.331-342, 2003.
DOI : 10.1007/3-540-36494-3_30

M. Habib and C. Paul, A survey of the algorithmic aspects of modular decomposition, Computer Science Review, vol.4, issue.1, pp.41-59, 2010.
DOI : 10.1016/j.cosrev.2010.01.001

R. Möhring, Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and Boolean functions, Annals of Operations Research, vol.69, issue.1, pp.195-225, 1985.
DOI : 10.1007/BF02022041

R. Möhring and F. 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

L. Lovász, Graph minor theory, Bulletin of the American Mathematical Society, vol.43, issue.01, pp.75-86, 2006.
DOI : 10.1090/S0273-0979-05-01088-8

D. B. West, Introduction to Graph Theory, 2000.