R. L. Brooks, On colouring the nodes of a network, Proc. Cambridge Phil, pp.194-197, 1941.

M. R. Cerioli, L. Faria, T. O. Ferreira, C. A. Martinhon, F. Protti et al., Partition into cliques for cubic graphs: Planar case, complexity and approximation, Discrete Applied Mathematics, vol.156, issue.12, pp.2270-2278, 2008.
DOI : 10.1016/j.dam.2007.10.015
URL : http://doi.org/10.1016/j.dam.2007.10.015

D. Cornaz and A. R. Mahjoub, The Maximum Induced Bipartite Subgraph Problem with Edge Weights, SIAM Journal on Discrete Mathematics, vol.21, issue.3
DOI : 10.1137/060650015

M. Dantas-da-silva, F. Protti, and J. L. Szwarcfiter, Applying modular decomposition to parameterized cluster editing problems, Theory of Computing Systems, vol.44, pp.91-104, 2009.

D. P. Dailey, Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete, Discrete Mathematics, vol.30, issue.3, pp.289-293, 1980.
DOI : 10.1016/0012-365X(80)90236-8

P. C. Fishburn, Interval graphs and interval orders, Discrete Mathematics, vol.55, issue.2, 1985.
DOI : 10.1016/0012-365X(85)90042-1
URL : http://doi.org/10.1016/0012-365x(85)90042-1

A. Galluccio, P. Hell, and J. Ne?et?il, The complexity of H-colouring of bounded degree graphs, Discrete Mathematics, vol.222, issue.1-3, pp.101-109, 2000.
DOI : 10.1016/S0012-365X(00)00009-1

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

J. Gramm, J. Guo, F. Hüffner, and R. Niedermeier, Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation, Theory of Computing Systems, pp.373-392, 2005.
DOI : 10.1007/3-540-44849-7_17

D. Lichtenstein, Planar Formulae and Their Uses, SIAM Journal on Computing, vol.11, issue.2, pp.329-393, 1982.
DOI : 10.1137/0211025

B. Reed, K. Smith, and A. Vetta, Finding odd cycle transversals, Operations Research Letters, vol.32, issue.4, pp.299-301, 2004.
DOI : 10.1016/j.orl.2003.10.009
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.6357

G. Manic and Y. Wakabayashi, Packing triangles in low-degree graphs and indifference graphs, Proc. European Conference on Combinatorics, Graph Theory and Applications (EuroComb'05), pp.251-256, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01184365

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.
DOI : 10.1145/800133.804355