C. Berge, Färbung von Graphen, deren sämtliche beziehungsweise, deren ungerade Kreise starr sind (Zusammenfassung), Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg, Math.-Naturwiss. Reihe, vol.10, pp.114-115, 1961.

C. Berge, Balanced matrices, Mathematical Programming, vol.38, issue.1, pp.19-31, 1972.
DOI : 10.1007/BF01584535

C. Berge and M. L. Vergnas, Sur un théorème du type König pour hypergraphes, Ann. N.Y. Acad. Sci, vol.175, pp.32-40, 1970.

F. Bonomo, M. Chudnovsky, and G. Durán, Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs, Discrete Applied Mathematics, vol.156, issue.7, pp.1058-1082, 2008.
DOI : 10.1016/j.dam.2007.05.048

F. Bonomo, M. Chudnovsky, and G. Durán, Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs, Discrete Mathematics, vol.309, issue.11, pp.3485-3499, 2009.
DOI : 10.1016/j.disc.2007.12.054

F. Bonomo, G. Durán, L. N. Grippo, and M. D. Safe, Partial characterizations of circular-arc graphs, Journal of Graph Theory, vol.42, issue.2, pp.289-306, 2009.
DOI : 10.1002/jgt.20379

F. Bonomo, G. Durán, and M. Groshaus, Coordinated graphs and clique graphs of clique-Helly perfect graphs, Util. Math, vol.72, pp.175-191, 2007.

F. Bonomo, G. Durán, M. C. Lin, and J. L. Szwarcfiter, On Balanced Graphs, Mathematical Programming, vol.6, issue.2-3, pp.2-3233, 2006.
DOI : 10.1007/s10107-005-0651-y

F. Bonomo, G. Durán, M. D. Safe, and A. K. Wagler, On minimal forbidden subgraph characterizations of balanced graphs, Electronic Notes in Discrete Mathematics, vol.35, pp.41-46, 2009.
DOI : 10.1016/j.endm.2009.11.008

F. Bonomo, G. Durán, M. D. Safe, and A. K. Wagler, Balancedness of some subclasses of circular-arc graphs, Electronic Notes in Discrete Mathematics, vol.36, pp.1121-1128, 2010.
DOI : 10.1016/j.endm.2010.05.142

F. Bonomo, G. Durán, F. Soulignac, and G. Sueiro, Partial characterizations of clique-perfect and coordinated graphs: Superclasses of triangle-free graphs, Discrete Applied Mathematics, vol.157, issue.17, pp.3511-3518, 2009.
DOI : 10.1016/j.dam.2009.03.017

F. Bonomo, G. Durán, F. Soulignac, and G. Sueiro, Partial characterizations of coordinated graphs: line graphs and complements of forests, Mathematical Methods of Operations Research, vol.12, issue.4, pp.251-270, 2009.
DOI : 10.1007/s00186-008-0257-2

M. Chudnovsky, N. Robertson, P. D. 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

G. Durán, M. C. Lin, and J. L. Szwarcfiter, On clique-transversal and clique-independent sets, Annals of Operations Research, vol.116, issue.1/4, pp.71-77, 2002.
DOI : 10.1023/A:1021363810398

D. R. Fulkerson and O. A. Gross, Incidence matrices and interval graphs, Pacific Journal of Mathematics, vol.15, issue.3, pp.835-855, 1965.
DOI : 10.2140/pjm.1965.15.835
URL : http://projecteuclid.org/download/pdf_1/euclid.pjm/1102995572

D. R. Fulkerson, A. J. Hoffman, and R. Oppenheim, On balanced matrices, Pivoting and Extensions, pp.120-133, 1974.
DOI : 10.1007/BFb0121244

F. Gavril, Algorithms on circular-arc graphs. Networks, pp.357-369, 1974.
DOI : 10.1002/net.3230040407

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

]. E. Helly, ¨ Uber Mengen konvexer Körper mit gemeinschaftlichen Punkten, Jber. Deutsch. Math.- Vereining, vol.32, pp.175-176, 1923.

A. J. Hoffman and J. B. , Integral boundary points of convex polyhedra, Linear Inequalities and Related Systems, pp.247-254, 1956.

B. L. Joeris, M. C. Lin, R. M. Mcconnell, J. P. Spinrad, and J. L. Szwarcfiter, Linear-Time Recognition of Helly Circular-Arc Models and Graphs, Algorithmica, vol.9, issue.2, pp.215-239, 2011.
DOI : 10.1007/s00453-009-9304-5

V. Klee, What Are the Intersection Graphs of Arcs in a Circle?, The American Mathematical Monthly, vol.76, issue.7, pp.810-813, 1969.
DOI : 10.2307/2317880

A. Lakshmanan, S. , and A. Vijayakumar, The <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mrow><mml:mo>???</mml:mo><mml:mi>t</mml:mi><mml:mo>???</mml:mo></mml:mrow></mml:math>-property of some classes of graphs, Discrete Mathematics, vol.309, issue.1, pp.259-263, 2009.
DOI : 10.1016/j.disc.2007.12.057

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

R. M. Mcconnell, Linear-Time Recognition of Circular-Arc Graphs, Algorithmica, vol.37, issue.2, pp.93-147, 2003.
DOI : 10.1007/s00453-003-1032-7

E. Prisner, Hereditary clique-Helly graphs, J. Combin. Math. Combin. Comput, vol.14, pp.216-220, 1993.

W. T. Trotter and J. I. Moore, Characterization problems for graphs, partially ordered sets, lattices, and families of sets, Discrete Mathematics, vol.16, issue.4, pp.361-381, 1976.
DOI : 10.1016/S0012-365X(76)80011-8

A. Tucker, Matrix characterizations of circular-arc graphs, Pacific Journal of Mathematics, vol.39, issue.2, pp.535-545, 1971.
DOI : 10.2140/pjm.1971.39.535

A. Tucker, Structure theorems for some circular-arc graphs, Discrete Mathematics, vol.7, issue.1-2, pp.167-195, 1974.
DOI : 10.1016/S0012-365X(74)80027-0

A. Tucker, Coloring a Family of Circular Arcs, SIAM Journal on Applied Mathematics, vol.29, issue.3, pp.493-502, 1975.
DOI : 10.1137/0129040

A. Tucker, An Efficient Test for Circular-Arc Graphs, SIAM Journal on Computing, vol.9, issue.1, pp.1-24, 1980.
DOI : 10.1137/0209001