V. E. Alekseev, On the local restriction effect on the complexity of finding the graph independence number, Combinatorial-algebraic Methods in Applied Mathematics Gorkiy, pp.3-13, 1983.

V. E. Alekseev, A polynomial algorithm for finding largest independent sets in fork-free graphs, Discrete Analysis and Operations Research Ser, Discrete Applied Mathematics, vol.1, issue.135, pp.3-19, 1999.

V. E. Alekseev, On easy and hard hereditary classes of graphs with respect to the independent set problem, Discrete Applied Mathematics, vol.132, issue.1-3, pp.17-26, 2004.
DOI : 10.1016/S0166-218X(03)00387-1

C. Arbib and R. Mosca, On (P5, diamond)-free graphs, Discrete Mathematics, vol.250, issue.1-3, pp.1-22, 2002.
DOI : 10.1016/S0012-365X(01)00268-0

G. Bacsó, . Zs, and . Tuza, Dominating cliques in P5-free graphs, Periodica Mathematica Hungarica, vol.3, issue.4, pp.4-303, 1990.
DOI : 10.1007/BF02352694

G. Bacsó, . Zs, and . Tuza, A characterization of graphs without long induced paths, Journal of Graph Theory, vol.41, issue.4, pp.4-455, 1990.
DOI : 10.1002/jgt.3190140409

R. Boliac and V. V. Lozin, Independent domination in finitely defined classes of graphs, Theoretical Computer Science, vol.301, issue.1-3, pp.271-284, 2003.
DOI : 10.1016/S0304-3975(02)00586-8

A. Brandstädt, (P5,diamond)-free graphs revisited: structure and linear time optimization, Discrete Applied Mathematics, vol.138, issue.1-2, pp.13-27, 2004.
DOI : 10.1016/S0166-218X(03)00266-X

A. Brandstädt and T. Chính, Hò ang, On clique separators, nearly chordal graphs and the Maximum Weight Stable Set problem, IPCO 2005, pp.265-275, 2005.

A. Brandstädt, H. Le, and V. B. Le, On ??-redundant vertices in P5-free graphs, Information Processing Letters, vol.82, issue.3, pp.119-122, 2002.
DOI : 10.1016/S0020-0190(01)00265-4

A. Brandstädt, V. B. Le, and S. Mahfud, New applications of clique separator decomposition for the Maximum Weight Stable Set problem, Theoretical Computer Science, vol.370, issue.1-3, pp.229-239, 2007.
DOI : 10.1016/j.tcs.2006.10.035

A. Brandstädt, V. B. Le, and J. P. Spinrad, Graph Classes: A Survey, SIAM Monographs on Discrete Math. Appl, vol.3, 1999.
DOI : 10.1137/1.9780898719796

A. Brandstädt and V. V. Lozin, A note on ??-redundant vertices in graphs, Discrete Applied Mathematics, vol.108, issue.3, pp.301-308, 2001.
DOI : 10.1016/S0166-218X(00)00239-0

A. Brandstädt, T. Klembt, and S. Mahfud, P 6 -and Triangle-Free Graphs Revisited: Structure and Bounded Clique-Width, Discrete Mathematics and Theoretical Computer Science, vol.8, pp.173-188, 2006.

A. Brandstädt and D. Kratsch, On domination problems for permutation and other graphs, Theoretical Computer Science, vol.54, issue.2-3, pp.181-198, 1987.
DOI : 10.1016/0304-3975(87)90128-9

A. Brandstädt and D. Kratsch, On the structure of (<mml:math altimg="si6.gif" 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:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>,gem)-free graphs, Discrete Applied Mathematics, vol.145, issue.2, pp.155-166, 2005.
DOI : 10.1016/j.dam.2004.01.009

A. Brandstädt and R. Mosca, On the structure and stability number of P5- and co-chair-free graphs, Discrete Applied Mathematics, vol.132, issue.1-3, pp.47-65, 2004.
DOI : 10.1016/S0166-218X(03)00389-5

G. Chang, The weighted independent domination problem is NP-complete for chordal graphs, Discrete Applied Mathematics, vol.143, issue.1-3, pp.351-352, 2004.
DOI : 10.1016/j.dam.2003.05.004

J. Dong, On the diameter of i???center in a graph without long induced paths, Journal of Graph Theory, vol.30, issue.3, pp.235-241, 1999.
DOI : 10.1002/(SICI)1097-0118(199903)30:3<235::AID-JGT8>3.3.CO;2-3

M. Farber, Independent domination in chordal graphs, Operations Research Letters, vol.1, issue.4, pp.134-138, 1982.
DOI : 10.1016/0167-6377(82)90015-3

M. Farber, On diameters and radii of bridged graphs, Discrete Mathematics, vol.73, issue.3, pp.249-260, 1989.
DOI : 10.1016/0012-365X(89)90268-9

M. Farber, M. Hujter, . Zs, and . Tuza, An upper bound on the number of cliques in a graph, Networks, vol.7, issue.3, pp.75-83, 1993.
DOI : 10.1002/net.3230230308

J. Fouquet, V. Giakoumakis, F. Maire, and H. Thuillier, On graphs without P 5 and P 5, Discrete Mathematics, pp.146-179, 1995.

J. Fouquet, V. Giakoumakis, and J. Vanherpe, BIPARTITE GRAPHS TOTALLY DECOMPOSABLE BY CANONICAL DECOMPOSITION, International Journal of Foundations of Computer Science, vol.10, issue.04, pp.513-533, 1999.
DOI : 10.1142/S0129054199000368
URL : https://hal.archives-ouvertes.fr/hal-00467645

A. Frank, Some polynomial algorithms for certain graphs and hypergraphs, Proceedings of the Fifth British Combinatorial Conference, pp.211-226, 1975.

M. R. Garey, D. S. Johnson, and L. Stockmeyer, Some simplified NP-complete graph problems, Theoretical Computer Science, vol.1, issue.3, pp.237-267, 1976.
DOI : 10.1016/0304-3975(76)90059-1

M. R. Garey and D. S. Johnson, The Rectilinear Steiner Tree Problem is $NP$-Complete, SIAM Journal on Applied Mathematics, vol.32, issue.4, pp.826-834, 1977.
DOI : 10.1137/0132071

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completness, 1979.

M. Gerber and V. V. Lozin, On the stable set problem in special P5-free graphs, Discrete Applied Mathematics, vol.125, issue.2-3, pp.215-224, 2003.
DOI : 10.1016/S0166-218X(01)00321-3

V. Giakoumakis and J. Vanherpe, -FREE GRAPHS, International Journal of Foundations of Computer Science, vol.14, issue.01, pp.107-136, 2003.
DOI : 10.1142/S0129054103001625
URL : https://hal.archives-ouvertes.fr/hal-00467645

V. Giakoumakis and I. Rusu, Weighted parameters in (P5, P5)-free graphs, Discrete Applied Mathematics, vol.80, issue.2-3, pp.255-261, 1997.
DOI : 10.1016/S0166-218X(97)00093-0

M. C. Golumbic and U. Rotics, ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES, International Journal of Foundations of Computer Science, vol.11, issue.03, pp.423-443, 2000.
DOI : 10.1142/S0129054100000260

M. Grötschel, L. Lovász, and A. Schrijver, Polynomial Algorithms for Perfect Graphs, Annals of Discrete Mathematics, vol.21, pp.325-356, 1984.
DOI : 10.1016/S0304-0208(08)72943-8

R. M. Karp, Reducibility among combinatorial problems, Complexity of Computer Computations, pp.85-103, 1972.
DOI : 10.1007/978-3-540-68279-0_8

J. Liu and H. Zhou, Dominating subgraphs in graphs with some forbidden structures, Discrete Mathematics, vol.135, issue.1-3, pp.163-168, 1994.
DOI : 10.1016/0012-365X(93)E0111-G

V. V. Lozin, Stability in P5- and banner-free graphs, European Journal of Operational Research, vol.125, issue.2, pp.292-297, 2000.
DOI : 10.1016/S0377-2217(99)00460-9

V. V. Lozin and M. Milani?, A polynomial algorithm to find an independent set of maximum weight in a fork-free graph, RUTCOR Research Report, pp.30-2005

V. V. Lozin and R. Mosca, Independent sets in extensions of <mml:math altimg="si4.gif" 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:mn>2</mml:mn><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math>-free graphs, Discrete Applied Mathematics, vol.146, issue.1, pp.74-80, 2005.
DOI : 10.1016/j.dam.2004.07.006

V. V. Lozin and D. Rautenbach, Some results on graphs without long induced paths, Information Processing Letters, vol.88, issue.4, pp.167-171, 2003.
DOI : 10.1016/j.ipl.2003.07.004

G. J. Minty, On maximal independent sets of vertices in claw-free graphs, Journal of Combinatorial Theory, Series B, vol.28, issue.3, pp.28-284, 1980.
DOI : 10.1016/0095-8956(80)90074-X

R. Mosca, Stable sets in certain P6-free graphs, Discrete Applied Mathematics, vol.92, issue.2-3, pp.177-191, 1999.
DOI : 10.1016/S0166-218X(99)00046-3

D. Nakamura and A. Tamura, A revision of Minty's algorithm for finding a maximum weight stable set in a claw-free graph, J. Operations Research Society of Japan, vol.44, pp.194-204, 2001.

S. Poljak, A note on stable sets and colorings of graphs, Commun. Math. Univ. Carolinae, vol.15, pp.307-309, 1974.

B. Randerath, I. Schiermeyer, and M. Tewes, Three-colourability and forbidden subgraphs. II: polynomial algorithms, Discrete Mathematics, vol.251, issue.1-3, pp.137-153, 2002.
DOI : 10.1016/S0012-365X(01)00335-1

N. Sbihi, Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sansétoilesans´sansétoile, Discrete Mathematics, pp.29-53, 1980.

I. E. Zverovich, Independent domination on 2P 3 -free perfect graphs, 2003.

I. E. Zverovich and V. E. Zverovich, Locally well-dominated and locally independent well-dominated graphs, Graphs and Combinatorics, vol.19, issue.2, pp.279-288, 2003.