. Note, K\{k 1 ,k 2 }) and c ? (S \{s 1 ,s 2 }) Then [x, a] ? (D \{ay, bc}) ? [b, s 2

R. M. Mcconnel and J. Spinrad, Linear-Time Modular Decomposition and Efficient Transitive Orientation of Comparability Graphs, 1993.

D. G. Corneil, H. Lerchs, and L. S. Burlingham, Complement reducible graphs, Discrete Applied Mathematics, vol.3, issue.3, pp.163-174, 1981.
DOI : 10.1016/0166-218X(81)90013-5

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

A. Cournier and M. Habib, A new linear algorithm for Modular Decomposition, LNCS, vol.787, pp.68-84, 1994.
DOI : 10.1007/BFb0017474

J. Fouquet and V. Giakoumakis, On semi-P 4 -sparse graphs, Discrete Math, pp.165-166, 1997.

M. R. Garey and D. S. Johnson, Computers and Intractability, a Guide to the Theory of, 1979.

V. Giakoumakis, On extended P 4 -sparse graphs, extended abstract, 4th Twente Workshop on Graphs and Combinatorial Optimization, 1995.

V. Giakoumakis, F. Roussel, and H. Thuillier, Scattering number and modular decomposition, Discrete Mathematics, vol.165, issue.166, pp.165-166, 1997.
DOI : 10.1016/S0012-365X(96)00180-X

V. Giakoumakis and J. M. Vanherpe, On extended P 4 -reducible graphs
URL : https://hal.archives-ouvertes.fr/hal-00467644

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

R. B. Hayward, Weakly triangulated graphs, Journal of Combinatorial Theory, Series B, vol.39, issue.3, pp.200-209, 1985.
DOI : 10.1016/0095-8956(85)90050-4
URL : http://doi.org/10.1016/0095-8956(85)90050-4

W. Hochstättler and G. Tinhofer, Hamiltonicity in graphs with few P 4 s, Rutcor Research Report 16-93

W. Hochstättler and H. Schindler, Recognizing P 4 -extendible graphs in linear time, extended abstract, 4th Twente Workshop on Graphs and Combinatorial Optimization, 1995.

B. Jamison and S. Olariu, -Reducible Graphs-Class of Uniquely Tree-Representable Graphs, Studies in Applied Mathematics, vol.18, issue.1, pp.79-87, 1989.
DOI : 10.1002/sapm198981179
URL : https://hal.archives-ouvertes.fr/in2p3-00529133

B. Jamison and S. Olariu, A linear-time recognition algorithm for P 4-reducible graphs, Lecture Notes in Computer Science, vol.405, pp.1-19, 1989.
DOI : 10.1007/3-540-52048-1_28

B. Jamison and S. Olariu, On a unique tree representation for P4-extendible graphs, Discrete Applied Mathematics, vol.34, issue.1-3, pp.151-164, 1991.
DOI : 10.1016/0166-218X(91)90085-B

B. Jamison and S. Olariu, A tree representation for P4-sparse graphs, Discrete Applied Mathematics, vol.35, issue.2, pp.115-129, 1992.
DOI : 10.1016/0166-218X(92)90036-A

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

B. Jamison and S. Olariu, Linear time optimization algorithms for P4-sparse graphs, Discrete Applied Mathematics, vol.61, issue.2, pp.155-175, 1995.
DOI : 10.1016/0166-218X(94)00012-3
URL : http://doi.org/10.1016/0166-218x(94)00012-3

B. Jamison and S. Olariu, A New Class of Brittle Graphs, Studies in Applied Mathematics, vol.16, issue.1, pp.89-92, 1989.
DOI : 10.1002/sapm198981189

B. Jamison and S. Olariu, P-Components and the Homogeneous Decomposition of Graphs, SIAM Journal on Discrete Mathematics, vol.8, issue.3, pp.448-463, 1995.
DOI : 10.1137/S0895480191196812

H. A. Jung, On a class of posets and the corresponding comparability graphs, Journal of Combinatorial Theory, Series B, vol.24, issue.2, pp.125-133, 1978.
DOI : 10.1016/0095-8956(78)90013-8

D. Kelly, Comparability graphs, in Graphs and Order, I. Rival, Reidel, pp.3-40, 1985.

D. Kratsch, T. Kloks, and H. Müller, Computing the toughness and the scattering number for interval and other graphs, p.19, 1994.
URL : https://hal.archives-ouvertes.fr/inria-00074433

R. H. Möhring, Algorithmic aspects of comparability graphs and interval graphs, in Graphs and Order, I. Rival, Reidel, pp.41-101, 1985.

R. H. Möhring and F. J. Radermacher, Substitution decomposition and connections with combinatorial optimization, Ann. Discrete Math, vol.19, pp.257-356, 1984.

G. Sabidussi, Graph derivatives, Mathematische Zeitschrift, vol.54, issue.1, pp.385-401, 1961.
DOI : 10.1007/BF01210984

Z. Skupie´nskupie´n, Path Partitions of Vertices and Hamiltonity of Graphs, Proc. of 2nd Czechoslov. Symp. on Graph Theory ? Praha 1974, Recent Advances in Graph Theory Fiedler) Academia Praha, pp.481-491, 1975.

J. Spinrad, P4-trees and substitution decomposition, Discrete Applied Mathematics, vol.39, issue.3, pp.263-291, 1992.
DOI : 10.1016/0166-218X(92)90180-I
URL : http://doi.org/10.1016/0166-218x(92)90180-i