]. G. Bac07 and . Bacs, Perfectly orderable graphs and unique colorability, Appl. Anal. Discrete Mathematics, vol.1, issue.2, pp.415-419, 2007.

M. [. Broere and . Burger, Uniquely cocolourable graphs, Graphs and Combinatorics, vol.3, issue.1, pp.201-208, 1986.
DOI : 10.1007/BF01788094

M. [. Broere and . Burger, Critically cochromatic graphs, Journal of Graph Theory, vol.3, issue.1, pp.23-28, 1989.
DOI : 10.1002/jgt.3190130106

]. C. Ber73 and . Berge, Graphs and hypergraphs [Dan01] A. Daneshgar. Forcing structures and cliques in uniquely vertex colorable graphs, SIAM Journal of Discrete Mathematics, vol.14, issue.4, pp.433-445, 1973.

M. Demange, T. Ekim, and D. De-werra, Partitioning cographs into cliques and stable sets, Discrete Optimization, vol.2, issue.2, pp.145-153, 2005.
DOI : 10.1016/j.disopt.2005.03.003

M. Demange, T. Ekim, and D. De-werra, (p, k)-coloring problems in line graphs, Electronic Notes in Discrete Mathematics, vol.19, issue.3, pp.462-474, 2005.
DOI : 10.1016/j.endm.2005.05.008

M. Demange, T. Ekim, and D. De-werra, On the approximation of Min Split-coloring and Min Cocoloring, Journal of Graph Algorithms and Applications, vol.10, issue.2, pp.297-315, 2006.
DOI : 10.7155/jgaa.00129
URL : https://hal.archives-ouvertes.fr/hal-00116689

M. Demange, T. Ekim, D. De-werra, and D. De-werra, A tutorial on the use of graph coloring for some problems in robotics On split-coloring problems, European Journal of Operational ResearchA. Dirac. On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg Journal of Combinatorial Optimization, vol.192, issue.11, pp.41-5571, 1961.

J. [. Ekim and . Gimbel, Partitioning graphs into complete and empty graphs, Discrete Mathematics, vol.309, issue.19, pp.5849-5856, 2009.
DOI : 10.1016/j.disc.2008.06.027

J. [. Erd?-os, D. Gimbel, and . Kratsch, Some extremal results in cochromatic and dichromatic theory, Journal of Graph Theory, vol.18, issue.6, pp.579-585, 1991.
DOI : 10.1002/jgt.3190150604

P. [. Földes, . J. Hammer, D. Gimbel, L. Kratsch, and . Stewart, Split graphs On cocolorings and cochromatic numbers of graphs, Congressum Numerantium Discrete Applied Mathematics, vol.19, issue.48, pp.311-315111, 1977.

H. [. Gimbel and . Straight, Some topics in cochromatic theory, Graphs and Combinatorics, vol.3, issue.1, pp.255-265, 1987.
DOI : 10.1007/BF01788548

T. Ekim, B. Ries, D. De-werra-[-hknp04-]-p, S. Hell, L. T. Klein et al., Partitioning chordal graphs into independent sets and cliques, Discrete Applied Mathematics, vol.141, pp.185-194, 2004.

]. L. Jor95 and . Jorgensen, Critical 3-Cochromatic Graphs, Graphs and Combinatorics, vol.11, pp.263-266, 1995.

H. [. Lesniak and . Straight, The cochromatic number of a graph, Ars Combinatoria, vol.3, pp.39-46, 1977.

]. J. Myc95 and . Mycielski, Sur le coloriage des graphs, Colloq. Math, vol.3, pp.161-162, 1995.

I. [. Roussel, H. Rusub, and . Thuillier, The Strong Perfect Graph Conjecture: 40 years of attempts, and its resolution, Discrete Mathematics, vol.309, issue.20, 2009.
DOI : 10.1016/j.disc.2009.05.024
URL : https://hal.archives-ouvertes.fr/inria-00475637

M. Truszczynacuteski, Some results on uniquely colorable graphs, in finite and infinite sets, 1984.

]. X. Zhu99 and . Zhu, Construction of uniquely H???colorable graphs, Journal of Graph Theory, vol.30, issue.1, pp.1-6, 1999.
DOI : 10.1002/(SICI)1097-0118(199901)30:1<1::AID-JGT1>3.3.CO;2-G