P. Alimonti and V. Kann, Some APX-completeness results for cubic graphs, Theoretical Computer Science, vol.237, issue.1-2, pp.123-134, 2000.
DOI : 10.1016/S0304-3975(98)00158-3

URL : http://doi.org/10.1016/s0304-3975(98)00158-3

G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-spaccamela et al., Complexity and Approximation: Combinatorial optimization problems and their approximability properties, 1999.
DOI : 10.1007/978-3-642-58412-1

M. Chang and H. Müller, On the Tree-Degree of Graphs, Proc. 27st International Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp.44-54, 2001.
DOI : 10.1007/3-540-45477-2_6

D. W. Cranston, N. Korula, T. D. Lesaulnier, K. Milans, C. Stocker et al., Overlap number of graphs, Journal of Graph Theory, vol.18, issue.1, pp.10-28, 2012.
DOI : 10.1002/jgt.20596

P. Erd?-os, A. W. Goodman, and L. Pósa, The intersection of a graph by set intersections, Canad, J. Math, vol.18, pp.106-112, 1966.

J. Gramm, J. Guo, F. Hüffner, and R. Niedermeier, Data reduction and exact algorithms for clique cover, ACM Journal of Experimental Algorithmics, vol.13, issue.22, pp.1-2, 2008.
DOI : 10.1145/1412228.1412236

J. Guillaume and M. Latapy, Bipartite structure of all complex networks, Information Processing Letters, vol.90, issue.5, pp.215-221, 2004.
DOI : 10.1016/j.ipl.2004.03.007

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

G. Higman, Ordering by Divisibility in Abstract Algebras, Proceedings of the London Mathematical Society, vol.3, issue.1, pp.326-336, 1952.
DOI : 10.1112/plms/s3-2.1.326

D. N. Hoover, Complexity of graph covering problems for graphs of low degree, Journal of Combinatorial Mathematics and Combinatorial Computing, vol.11, pp.187-200, 1992.

W. Hsu and K. Tsai, Linear time algorithms on circular-arc graphs, Information Processing Letters, vol.40, issue.3, pp.123-129, 1991.
DOI : 10.1016/0020-0190(91)90165-E

L. T. Kou, L. J. Stockmeyer, and C. K. Wong, Covering edges by cliques with regard to keyword conflicts and intersection graphs, Communications of the ACM, vol.21, issue.2, pp.135-139, 1978.
DOI : 10.1145/359340.359346

C. Lund and M. Yannakakis, The approximation of maximum subgraph problems, Proc. 20th Int. Colloqium on Automata, pp.40-51, 1994.
DOI : 10.1007/3-540-56939-1_60

S. Ma, W. D. Wallis, and J. Wu, Clique covering of chordal graphs, Utilitas Mathematica, vol.36, pp.151-152, 1989.

T. A. Mckee and F. R. Mcmorris, Topics in intersection graph theory, SIAM monographs on discrete mathematics and applications, 1999.

I. Nor, D. Hermelin, S. Charlat, J. Engelstadter, M. Reuter et al., Mod/Resc Parsimony Inference, Proc. 21st Annual Symposium on Combinatorial Pattern Matching, pp.202-213, 2010.
DOI : 10.1007/978-3-642-13509-5_19

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

J. B. Orlin, Contentment in graph theory: Covering graphs with cliques, Indagationes Mathematicae (Proceedings), vol.80, issue.5, pp.406-424, 1977.
DOI : 10.1016/1385-7258(77)90055-5

B. Rosgen, Set representations of graphs, 2005.

B. Rosgen and L. Stewart, The overlap number of a graph, 2010.