C. Berge, Färbung von Graphen deren sämtliche bzw. deren ungerade Kreise starr (Zusammenfassung ), Wissenschaftliche Zeitschrift, pp.114-115, 1961.

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

D. G. Corneil, Y. Perl, and L. K. Stewart, A Linear Recognition Algorithm for Cographs, SIAM Journal on Computing, vol.14, issue.4, pp.926-934, 1985.
DOI : 10.1137/0214065

E. Dahlhaus, J. Gustedt, and R. M. Mcconnell, Efficient and Practical Algorithms for Sequential Modular Decomposition, Journal of Algorithms, vol.41, issue.2, pp.360-387, 2001.
DOI : 10.1006/jagm.2001.1185
URL : https://hal.archives-ouvertes.fr/inria-00100822

E. M. Eschen, J. L. Johnson, J. P. Spinrad, and R. Sritharan, Recognition of some perfectly orderable graph classes, Discrete Applied Mathematics, vol.128, issue.2-3, pp.355-373, 2003.
DOI : 10.1016/S0166-218X(02)00499-7

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

M. Habib, R. M. Mcconnell, C. Paul, and L. Viennot, Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing, Theoretical Computer Science, vol.234, issue.1-2, pp.59-84, 2000.
DOI : 10.1016/S0304-3975(97)00241-7

M. Habib, C. Paul, and L. Viennot, Linear time recognition of P 4 -indifference graphs, Discrete Math. and Theoret. Comput. Sci, vol.4, pp.173-178, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00072882

P. L. Hammer and B. Simeone, The splittance of a graph, Combinatorica, vol.32, issue.3, pp.275-284, 1981.
DOI : 10.1007/BF02579333

A. Hertz, Bipolarizable graphs, Discrete Math, pp.25-32, 1990.
DOI : 10.1016/0012-365x(90)90176-i
URL : http://doi.org/10.1016/0012-365x(90)90176-i

C. T. Hò-ang and N. Khouzam, On brittle graphs, Journal of Graph Theory, vol.2, issue.3, pp.391-404, 1988.
DOI : 10.1002/jgt.3190120310

C. T. Hò-ang, F. Maffray, and M. Noy, A characterization of P 4 -indifference graphs, J. Graph Theory, vol.31, pp.155-162, 1999.

C. T. Hò-ang and B. A. Reed, Some classes of perfectly orderable graphs, Journal of Graph Theory, vol.1, issue.4, pp.445-463, 1989.
DOI : 10.1002/jgt.3190130407

C. T. Hò-ang and B. A. , Reed, P 4 -comparability graphs, Discrete Math, pp.173-200, 1989.

C. T. Hò-ang and R. Sritharan, Finding houses and holes in graphs, Theoretical Computer Science, vol.259, issue.1-2, pp.233-244, 2001.
DOI : 10.1016/S0304-3975(00)00005-0

B. Jamison and S. Olariu, Recognizing $P_4 $-Sparse Graphs in Linear Time, SIAM Journal on Computing, vol.21, issue.2, pp.381-407, 1992.
DOI : 10.1137/0221027

B. Jamison and S. Olariu, A linear-time recognition algorithm for P4-reducible graphs, Theoretical Computer Science, vol.145, issue.1-2, pp.329-344, 1995.
DOI : 10.1016/0304-3975(95)00016-P

R. M. Mcconnell and J. Spinrad, Linear-time modular decomposition and efficient transitive orientation, Proc. 5th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA'94), pp.536-545, 1994.

M. Middendorf and F. Pfeiffer, On the complexity of recognizing perfectly orderable graphs, Discrete Math, pp.327-333, 1990.

S. D. Nikolopoulos and L. Palios, Algorithms for P4-Comparability Graph Recognition and Acyclic P4-Transitive Orientation, Algorithmica, vol.39, issue.2, pp.95-126, 2004.
DOI : 10.1007/s00453-003-1075-9

S. D. Nikolopoulos and L. Palios, Recognizing HHD-free and Welsh-Powell Opposition Graphs, Proc. 30th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG'04), pp.105-116, 2004.
DOI : 10.1007/978-3-540-30559-0_9
URL : https://hal.archives-ouvertes.fr/hal-00961102

S. Olariu, Weak bipolarizable graphs, Discrete Math, pp.159-171, 1989.
DOI : 10.1016/0012-365x(89)90208-2
URL : http://doi.org/10.1016/0012-365x(89)90208-2

R. Rizzi, On the recognition of P4-indifferent graphs, Discrete Math, pp.161-169, 2001.

D. J. Rose, R. E. Tarjan, and G. S. Lueker, Algorithmic Aspects of Vertex Elimination on Graphs, SIAM Journal on Computing, vol.5, issue.2, pp.266-283, 1976.
DOI : 10.1137/0205021

A. A. Schäffer, Recognizing brittle graphs: remarks on a paper of Ho??ng and Khouzam, Discrete Applied Mathematics, vol.31, issue.1, pp.29-35, 1991.
DOI : 10.1016/0166-218X(91)90030-Z