In this thesis, we study the clique-coloring of graphs. A clique of G is a complete subgraph of G, or equivalently a subset of V(G), which induces a complete subgraph of G. A clique is said to be maximal if it is not properly contained in any other clique of G. We call clique-hypergraph of G the hypergraph ?(G) = (V, ? ) that has the same vertices as G and whose set of hyperedges is the set of maximal cliques of G of cardinality at least two. A k -coloring of ?(G) will also be called a k-clique-coloring of G, and the chromatic number of ?(G) the clique-chromatic number of G.