S. Seidman, Network structure and minimum degree, Social Networks, vol.5, issue.3, pp.269-287, 1983.
DOI : 10.1016/0378-8733(83)90028-X

K. Bhawalkar, J. Kleinberg, K. Lewi, T. Roughgarden, and A. Sharma, Preventing unraveling in social networks: the anchored k-core problem, Automata, Languages, and Programming, pp.440-451, 2012.

B. Pittel, J. Spencer, and N. Wormald, Sudden Emergence of a Giantk-Core in a Random Graph, Journal of Combinatorial Theory, Series B, vol.67, issue.1, pp.111-151, 1996.
DOI : 10.1006/jctb.1996.0036

P. Erdös and A. Rényi, On the evolution of random graphs, Publ. Math. Inst. Hungar. Acad. Sci, vol.5, pp.17-61, 1960.

G. Szekeres and H. S. Wilf, An inequality for the chromatic number of a graph, Journal of Combinatorial Theory, vol.4, issue.1, pp.1-3, 1968.
DOI : 10.1016/S0021-9800(68)80081-X

D. Eppstein, M. Löffler, and D. Strash, Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time, 1006.
DOI : 10.1007/978-3-642-17517-6_36

C. Giatsidis, D. Thilikos, and M. Vazirgiannis, Evaluating Cooperation in Communities with the k-Core Structure, 2011 International Conference on Advances in Social Networks Analysis and Mining, pp.87-93, 2011.
DOI : 10.1109/ASONAM.2011.65

J. Alvarez-hamelin, L. Asta, A. Barrat, and A. Vespignani, Large scale networks fingerprinting and visualization using the k-core decomposition Advances in neural information processing systems, p.41, 2006.

M. Baur, U. Brandes, M. Gaertler, and D. Wagner, Drawing the AS Graph in 2.5 Dimensions, Graph Drawing, pp.43-48, 2005.
DOI : 10.1007/978-3-540-31843-9_6

S. Carmi, S. Havlin, S. Kirkpatrick, Y. Shavitt, and E. Shir, A model of Internet topology using k-shell decomposition, Proceedings of the National Academy of Sciences, vol.104, issue.27, pp.11-150, 2007.
DOI : 10.1073/pnas.0701175104

D. E. Knuth, The Stanford GraphBase: a platform for combinatorial computing, 1993.

V. Batagelj and M. Zaversnik, An o (m) algorithm for cores decomposition of networks, 2003.

M. T. Goodrich and P. Pszona, External-Memory Network Analysis Algorithms for Naturally Sparse Graphs, 1106.
DOI : 10.1007/978-3-642-23719-5_56

D. R. Lick and A. T. White, $k$-degenerate graphs, Journal canadien de math??matiques, vol.22, issue.0, pp.1082-1096, 1970.
DOI : 10.4153/CJM-1970-125-1

P. Erd?-os and A. Hajnal, On chromatic number of graphs and set-systems, Acta Mathematica Academiae Scientiarum Hungaricae, vol.24, issue.66, pp.61-99, 1966.
DOI : 10.1007/BF02020444

A. Montresor, F. D. Pellegrini, and D. Miorandi, Distributed k-core decomposition, 1103.
DOI : 10.1109/tpds.2012.124
URL : http://arxiv.org/abs/1103.5320

R. Bauer, M. Krug, and D. Wagner, Enumerating and generating labeled k-degenerate graphs, 7th Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pp.90-98, 2010.

A. Barabási and R. Albert, Emergence of scaling in random networks, science, vol.286, issue.5439, pp.509-512, 1999.

Y. Ahn, J. P. Bagrow, and S. Lehmann, Link communities reveal multiscale complexity in networks, Nature, vol.80, issue.7307, pp.761-764, 2010.
DOI : 10.1038/nature09182

B. C. Arnold, Majorization and the Lorenz order: a brief introduction, 1987.
DOI : 10.1007/978-1-4615-7379-1

C. E. Shannon, A mathematical theory of communication, ACM SIGMOBILE Mobile Computing and Communications Review, vol.5, issue.1, pp.3-55, 2001.
DOI : 10.1145/584091.584093

R. L. Cross and A. Parker, The hidden power of social networks: Understanding how work really gets done in organizations, 2004.

L. A. Adamic and N. Glance, The political blogosphere and the 2004 us election: divided they blog, Proceedings of the 3rd international workshop on Link discovery, pp.36-43, 2005.

C. Rozenblat, G. Melançon, and P. Koenig, Continental integration in multilevel approach of world air transportation, Networks and Spatial Economics, 2000.

P. M. Gleiser and L. Danon, Community structure in jazz Advances in complex systems, pp.565-573, 2003.