Y. Y. Ahn, J. P. Bagrow, and S. Lehmann, Link communities reveal multiscale complexity in networks, Nature, vol.466, issue.7307, pp.761-764, 2010.

L. W. Beineke, Characterizations of derived graphs, Journal of Combinatorial Theory, vol.9, issue.2, pp.129-135, 1970.

M. Campêlo, V. A. Campos, and R. C. Corrêa, On the asymmetric representatives formulation for the vertex coloring problem, Discrete Applied Mathematics, vol.156, issue.7, pp.1097-1111, 2008.

M. Campêlo, P. F. Moura, and M. C. Santos, On the representatives k-fold coloring polytope, Electronic Notes in Discrete Mathematics, vol.44, pp.239-244, 2013.

A. G. Clark, Inference of haplotypes from PCR-amplified samples of diploid populations., Molecular Biology and Evolution, vol.7, pp.111-122, 1990.

T. S. Evans and R. Lambiotte, Line graphs, link partitions, and overlapping communities, Physical Review E, vol.80, issue.1, p.16105, 2009.

B. V. Halldórsson, D. Blokh, and R. Sharan, Estimating population size via line graph reconstruction, Algorithms for Molecular Biology, vol.8, issue.1, pp.8-17, 2013.

M. R. Hoehe, K. Kopke, B. Wendel, K. Rohde, C. Flachmeier et al., Sequence variability and candidate gene analysis in complex disease: association of micro opioid receptor gene variation with substance dependence, Human Molecular Genetics, vol.9, issue.19, pp.2895-2908, 2000.

J. Krausz, 3 Note relative à un théorème de Mr. Malmstèn sur les équations différentielles linéaires, Band 40, vol.50, pp.48-50, 1850.

P. G. Lehot, An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph, Journal of the ACM, vol.21, issue.4, pp.569-575, 1974.

A. Ma?ka-kraso?, A. Mwijage, and K. Ku?akowski, Clustering in random line graphs, Computer Physics Communications, vol.181, issue.1, pp.118-121, 2010.

J. Naor and M. B. Novick, An efficient reconstruction of a graph from its line graph in parallel, Journal of Algorithms, vol.11, issue.1, pp.132-143, 1990.

N. J. Pullman, Clique coverings of graphs ? A survey, Lecture Notes in Mathematics, pp.72-85, 1983.

N. D. Roussopoulos, A max {m,n} algorithm for determining the graph H from its line graph G, Information Processing Letters, vol.2, issue.4, pp.108-112, 1973.

J. D. Terwilliger and K. M. Weiss, Linkage disequilibrium mapping of complex disease: fantasy or reality?, Current Opinion in Biotechnology, vol.9, issue.6, pp.578-594, 1998.

, Integrating common and rare genetic variation in diverse human populations, Nature, vol.467, issue.7311, pp.52-58, 2010.

A. C. Van-rooij and H. S. Wilf, The interchange graph of a finite graph, Acta Mathematica Academiae Scientiarum Hungarica, vol.16, pp.263-269, 1965.

H. Whitney, Congruent Graphs and the Connectivity of Graphs, Hassler Whitney Collected Papers, pp.61-79, 1992.

J. C. Wierman, D. P. Naor, and J. Smalletz, Incorporating variability into an approximation formula for bond percolation thresholds of planar periodic lattices, Physical Review E, vol.75, issue.1, p.11114, 2007.

M. Yannakakis, Node-and edge-deletion NP-complete problems, Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78, pp.253-264, 1978.