On (PS, diamond)-free graphs

Discrete Mathematics

Volumn 250, Issue 1-3, 2002, Pages 1-22

  Arbib, Claudio ^a   Mosca, Raffaele ^a  

^a UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

Chromatic number; Clique cover; Ps free graphs; Stability number

Indexed keywords

EID: 31244432997     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(01)00268-0     Document Type: Article

References (21)

1. C. Arbib, R. Mosca, Polynomial algorithms for special cases of the balanced complete bipartite subgraph problem, J. Combin. Math. Comput. 30 (1999) 3-22.
2. G. Bacsö, Zs. Tuza, Dominating cliques in P5-free graphs, Period. Math. Hung. 21 (4) (1990) 303-308.
3. Z. Blâzski, M. Hujter, M. Pluhâr, Zs. Tuza, Graphs with no induced C4 and 2K2, Discrete Math. 115 (1993) 51-55.
4. D. Cao, G.L. Kernhäuser, Polyhedral characterization and perfection of line graphs, Discrete Appl. Math. 81 (1998) 141-154.
5. V. Chvâtal, C.T. Hodng, N.V.R. Mahadev, D. de Werra, Four classes of perfectly orderable graphs, J. Graph Theory 11 (1987) 481-495.
6. C. De Simone, A. Sassano, Stability number of bull- and chair-free graphs, Discrete Appl. Math. 41 (1993) 121-129.
7. J.-L. Fouquet, V. Giakoumakis, F. Maire, H. Thuillier, On graphs without PS and PS, Discrete Math. 146 (1995) 33-44.
8. A. Galluccio, A. Sassano, The rank facets of the stable set polytope for claw-free graphs, J. Combin. Theory, Ser. B 69 (1) (1997) 1-38.
9. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-compIeteness, Freeman & Co., San Francisco, CA, 1979.
10. V. Giakoumakis, I. Rusu, Weighted parameters in (Pj.PsJ-free graphs, Discrete Appl. Math. 80 (2-3) (1997) 255-261.
11. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
12. M. Grötschel, L. Lovâsz, A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1988.
13. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1972.
14. I. Holyer, The NP-completeness of edge-coloring, SIAM J. Comput. 10 (1981) 718-721.
15. W.L. Hsu, Y. Ikura, G.L. Nemhauser, A polynomial algorithm for maximum weighted vertex packings in graphs without long odd cycles, Math. Prog. 20 (1981) 225-232.
16. W.L. Hsu, G.L. Nemhauser, Algorithms for minimum covering by cliques and maximum clique in claw-free perfect graphs, Discrete Math. 38 (1982) 65-71.
17. G.J. Minty, On maximal independent sets of vertices in claw-free graphs, J. Combin. Theory, Ser. B 28 (1980) 284-304.
18. R. Mosca, A note on the stable sets of certain PS-free graphs, submitted for publication.
19. S. Poljak, A note on stable sets and colorings of graphs, Comment. Math. Univ. Carolinae 15 (1974) 307-309.
20. J. Puech, Irredundance perfect and P6-free Graphs, J. Graph Theory 29 (1998) 239-255.
21. W. Zang, Coloring graphs with no odd-fC, Discrete Math. 184 (1998) 205-212.