M. Aigner and T. Andreae, Vertex sets that meet all maximal cliques of a graph, 1986.

N. Alon and J. Spencer, The probabilistic method, 2000.

T. Andreae, M. Schughart, and Z. Tuza, Clique-transversal sets of line graphs and complements of line graphs, Discrete Mathematics, vol.88, issue.1, pp.11-20, 1991.
DOI : 10.1016/0012-365X(91)90055-7

G. Bacsó, S. Gravier, A. Gyárfás, M. Preissmann, and A. Seb?, Coloring the Maximal Cliques of Graphs, SIAM Journal on Discrete Mathematics, vol.17, issue.3, pp.361-376, 2004.
DOI : 10.1137/S0895480199359995

C. Berge, Sur certains hypergraphes généralisant les graphes bipartis, dans : Combinatorial Theory and Its Applications I, pp.119-133, 1970.

C. Berge, Some properties of non-bicolorable hypergraphs and the four-color problem, Discrete Applied Mathematics, vol.65, issue.1-3, pp.73-79, 1996.
DOI : 10.1016/0166-218X(95)00028-P

C. Berge and J. L. , Ramírez Alfonsín, Origins and genesis, pp.1-12

D. Bienstock, On the complexity of testing for odd holes and induced odd paths, Discrete Mathematics, vol.90, issue.1, pp.85-92, 1991.
DOI : 10.1016/0012-365X(91)90098-M

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

M. Chudnovsky, G. Cornuéjols, X. Liu, P. Seymour, and K. Vu?kovi?, Recognizing Berge Graphs, Combinatorica, vol.25, issue.2, pp.143-186, 2005.
DOI : 10.1007/s00493-005-0012-8

M. Chudnovsky, N. Robertson, P. Seymour, and R. Thomas, The strong perfect graph theorem, Annals of Mathematics, vol.164, issue.1, pp.51-229, 2006.
DOI : 10.4007/annals.2006.164.51

]. V. Chvátal and N. Sbihi, Bull-free Berge graphs are perfect, Graphs and Combinatorics, vol.16, issue.1, pp.127-139, 1987.
DOI : 10.1007/BF01788536

V. Chvátal and N. Sbihi, Recognizing claw-free perfect graphs, Journal of Combinatorial Theory, Series B, vol.44, issue.2, pp.154-176, 1988.
DOI : 10.1016/0095-8956(88)90085-8

M. Conforti, G. Cornuéjols, X. Liu, K. Vu?kovi?, and G. Zambelli, Odd Hole Recognition in Graphs of Bounded Clique Size, SIAM Journal on Discrete Mathematics, vol.20, issue.1, pp.42-48, 2006.
DOI : 10.1137/S089548010444540X

M. Conforti, G. Cornuéjols, and M. R. Rao, Decomposition of Balanced Matrices, Journal of Combinatorial Theory, Series B, vol.77, issue.2, pp.292-406, 1999.
DOI : 10.1006/jctb.1999.1932

M. Conforti, G. Cornuéjols, and K. Vu?kovi?, Decomposition of odd-hole-free graphs by double star cutsets and 2-joins, Discrete Applied Mathematics, vol.141, issue.1-3, pp.41-91, 2004.
DOI : 10.1016/S0166-218X(03)00364-0

S. A. Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing , STOC '71, pp.151-158, 1971.
DOI : 10.1145/800157.805047

D. Défossez, Coloration des cliques maximales d'un graphe, 2003.

D. Défossez, Clique-coloring some classes of odd-hole-free graphs, Journal of Graph Theory, vol.21, issue.3, pp.233-249, 2006.
DOI : 10.1002/jgt.20177

P. Duchet, Hypergraphs, dans : Handbook of Combinatorics, pp.381-432, 1995.

D. Duffus, H. A. Kierstead, and W. T. Trotter, Fibres and ordered set coloring, Journal of Combinatorial Theory, Series A, vol.58, issue.1, pp.58-158, 1991.
DOI : 10.1016/0097-3165(91)90083-S
URL : http://doi.org/10.1016/0097-3165(91)90083-s

D. Duffus, B. Sands, N. Sauer, and R. E. Woodrow, Two-colouring all two-element maximal antichains, Journal of Combinatorial Theory, Series A, vol.57, issue.1, pp.57-109, 1991.
DOI : 10.1016/0097-3165(91)90009-6
URL : http://doi.org/10.1016/0097-3165(91)90009-6

P. Erd?s, On a combinatorial problem, Nordisk. Mat. Tidskr, vol.3, pp.5-10, 1963.

P. Erd?s, T. Gallai, . Zs, and . Tuza, Covering the cliques of a graph with vertices, Discrete Mathematics, vol.108, issue.1-3, pp.279-289, 1992.
DOI : 10.1016/0012-365X(92)90681-5

P. Erd?s and A. , On chromatic number of graphs and set-systems, Acta Mathematica Academiae Scientiarum Hungaricae, vol.24, issue.66, pp.61-99, 1966.
DOI : 10.1007/BF02020444

P. Erd?s and L. Lovász, Problems and results on 3-chromatic hypergraphs and some related questions, dans : Infinite and Finite Sets, pp.609-627, 1975.

J. Fonlupt and A. Zemirline, A polynomial recognition algorithm of (K 4 ? e)-free perfect graphs, Institut IMAG Rapport Technique RT, vol.16, 1987.

J. Fournier and M. L. Vergnas, Une classe d'hypergraphes bichromatiques, Discrete Mathematics, vol.2, issue.4, pp.407-410, 1972.
DOI : 10.1016/0012-365X(72)90018-0

J. Fournier and M. , Une classe d'hypergraphes bichromatiques II, Discrete Mathematics, vol.7, issue.1-2, pp.99-106, 1974.
DOI : 10.1016/S0012-365X(74)80021-X

J. Fournier and M. , Las Vergnas, A class of bichromatic hypergraphs, Topics on Perfect Graphs, pp.21-27, 1984.

D. R. Fulkerson, Anti-blocking polyhedra, Journal of Combinatorial Theory, Series B, vol.12, issue.1, pp.50-71, 1972.
DOI : 10.1016/0095-8956(72)90032-9

M. Golumbic, Algorithmic Graph Theory and Perfect Graphs, 1980.

S. Gravier, C. T. Hoàng, and F. Maffray, Coloring the hypergraph of maximal cliques of a graph with no long path, Discrete Mathematics, vol.272, issue.2-3, pp.285-290, 2003.
DOI : 10.1016/S0012-365X(03)00197-3

S. Gravier and R. ?krekovski, Coloring the clique hypergraph of graphs without forbidden structure, Les cahiers du laboratoire Leibniz, vol.83, 2003.

M. Grötschel, L. Lovász, and A. Schr?ver, Geometric algorithms and combinatorial optimization, 1988.

V. Guruswami and C. Pandu-rangan, Algorithmic aspects of clique-transversal and clique-independent sets, Discrete Applied Mathematics, vol.100, issue.3, pp.183-202, 2000.
DOI : 10.1016/S0166-218X(99)00159-6

M. Herzog and J. Schönheim, The Br property and chromatic numbers of generalized graphs, Journal of Combinatorial Theory, Series B, vol.12, issue.1, pp.41-49, 1972.
DOI : 10.1016/0095-8956(72)90031-7

T. Jensen and B. Toft, Graph coloring problems, 1995.
DOI : 10.1002/9781118032497

C. T. Hoàng and C. Mcdiarmid, On the divisibility of graphs, Discrete Mathematics, vol.242, issue.1-3, pp.145-156, 2002.
DOI : 10.1016/S0012-365X(01)00054-1

J. Kratochvíl, . Zs, and . Tuza, On the complexity of bicoloring clique hypergraphs of graphs, Journal of Algorithms, vol.45, issue.1, pp.40-54, 2002.
DOI : 10.1016/S0196-6774(02)00221-3

M. Lepp, Brooks' theorem is true for hypergraphs, abstract, Notices AMS, 1975.

Z. Lonc and I. , Rival, Chains, antichains, and fibres, Journal of Combinatorial Theory, pp.44-207, 1987.
DOI : 10.1016/0097-3165(87)90029-x
URL : http://doi.org/10.1016/0097-3165(87)90029-x

L. Lovász, Combinatorial problems and exercises, 1993.
DOI : 10.1090/chel/361

L. Lovász, Coverings and colorings of hypergraphs, Proc. 4th Southeastern Conference on Combinatorics, Graph Theory, and Computing, pp.3-12, 1973.

L. Lovász, Normal hypergraphs and the perfect graph conjecture, Discrete Mathematics, vol.2, issue.3, pp.253-267, 1972.
DOI : 10.1016/0012-365X(72)90006-4

L. Lovász, On chromatic number of finite set-systems, Acta Mathematica Academiae Scientiarum Hungaricae, vol.24, issue.66, pp.59-67, 1968.
DOI : 10.1007/BF01894680

C. Mcdiarmid, Hypergraph colouring and the Lov??sz Local Lemma, Discrete Mathematics, vol.167, issue.168, pp.481-486, 1997.
DOI : 10.1016/S0012-365X(96)00249-X

F. Maffray and M. Preissmann, Sequential colorings and perfect graphs, Discrete Applied Mathematics, vol.94, issue.1-3, pp.287-296, 1999.
DOI : 10.1016/S0166-218X(99)00026-8
URL : http://doi.org/10.1016/s0166-218x(99)00026-8

D. Marx, Complexity of clique coloring and related problems, manuscript. [55] H. Meyniel, The graphs whose odd cycles have at least two chords, Discrete Mathematics, vol.21, pp.115-119, 1984.

J. Mycielski, Sur le coloriage des graphes, Colloq. Math, vol.3, pp.161-162, 1955.

B. Mohar and R. ?krekovski, The Grötzsch Theorem for the hypergraph of maximal cliques, The Electronic Journal of Combinatorics, vol.6, p.26, 1999.

J. Ne?et?il and V. , A short proof of the existence of highly chromatic hypergraphs without short cycles, Journal of Combinatorial Theory, Series B, vol.27, issue.2, pp.225-227, 1979.
DOI : 10.1016/0095-8956(79)90084-4

C. H. Papadimitriou, Computational complexity, 1994.

K. R. Parthasarathy and G. Ravindra, The strong perfect-graph conjecture is true for K1,3-free graphs, Journal of Combinatorial Theory, Series B, vol.21, issue.3, pp.212-223, 1976.
DOI : 10.1016/S0095-8956(76)80005-6

H. J. Prömel and A. Steger, Almost all Berge Graphs are Perfect, Combinatorics, Probability and Computing, vol.2, issue.01, pp.53-79, 1992.
DOI : 10.1002/rsa.3240020106

G. Ravindra, Meyniel's Graphs are Strongly Perfect, Discrete Mathematics, vol.21, pp.145-148, 1984.
DOI : 10.1016/S0304-0208(08)72929-3

B. Reed and N. Sbihi, Recognizing bull-free perfect graphs, Graphs and Combinatorics, vol.16, issue.2, pp.171-178, 1995.
DOI : 10.1007/BF01929485

T. J. Schaefer, The complexity of satisfiability problems, Proceedings of the tenth annual ACM symposium on Theory of computing , STOC '78, pp.216-226, 1978.
DOI : 10.1145/800133.804350

P. D. Seymour, ON THE TWO-COLOURING OF HYPERGRAPHS, The Quarterly Journal of Mathematics, vol.25, issue.1, pp.303-312, 1974.
DOI : 10.1093/qmath/25.1.303

F. Sterboul, Un problème extrémal en théorie des hypergraphes, C. R. Acad. Sci. Paris Sér. A, vol.278, pp.9-12, 1974.

F. Sterboul, Communication at the Graph Theory Seminar, 1973.

. Zs and . Tuza, Covering all cliques of a graph, Discrete Mathematics, vol.86, pp.117-126, 1990.

D. R. Woodall, Property B and the four-color problem, Combinatorics, Institute of Mathematics and its Applications, Southen-on-sea, pp.322-340, 1972.