On a graph transformation that preserves the stability number

Yugoslav Journal of Operations Research

Volumn 10, Issue 1, 2000, Pages 1-12

  Hertz, Alain ^a  

^a EPFL   (Switzerland)

Author keywords

Boolean methods; Polynomial algorithms; Stability number

Indexed keywords

EID: 0142221572     PISSN: 03540243     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. Balas, E., ChvÃtal, V., and Nesetril, J., "On the maximum weight clique problem", Mathematics of Operations Research, 12 (1987) 522-535.
2. Berge, C., Graphs and Hypergraphs, North-Holland, Amsterdam, 1973.
3. De Simone, C., "On the vertex packing problem", Graphs and Combinatorics, 9 (1993) 19-30.
4. De Simone, C., and Sassano, A., "Stability number of bull æ and chair-free graphs", Discrete Applied Mathematics, 41 (1993) 121-129.
5. Ebenegger, Ch., Hammer, P.L., and De Werra, D., "Pseudo-Boolean functions and stability of graphs", Annals of Discrete Mathematics, 19 (1984) 83-98.
6. Garey, M.R., and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, San Francisco, 1978.
7. Golumbic, M.C., and Hammer, P.L., "Stability in circular arc graphs", RUTCOR Research Report 12-86, Rutgers University, 1986.
8. Groetschel, M., LovÃsz, L., and Schrijver, A., "Polynomial algorithms for perfect graphs", Annals of Discrete Mathematics, 21 (1984) 325-356.
9. Hammer, P.L., Mahadev, N.V.R., and De Werra, D., "Stability in CAN-free graphs", J. of Combinatorial Theory B, 38 (1985) 23-30.
10. Hammer, P.L., Mahadev, N.V.R., and De Werra, D., "The struction of a graph: application to CN-free graphs", Combinatorica 5, (1985) 141-147.
11. Hammer, P.L., and Rudeanu, S., Boolean Methods in Operations Research, Springler-Verlag, New York, 1968.
12. Hertz, A., "Quelques utilisations de la struction", Discrete Mathematics, 59 (1986) 79-89.
13. Hertz, A., "Polynomially solvable cases for the maximum stable set problem", Discrete Applied Mathematics, 60 (1995) 195-210.
14. Hertz, A., "On the use of Boolean methods for the computation of the stability number", Discrete Applied Mathematics, 76 (1997) 183-203.
15. Hertz, A., and De Werra, D., "On the stability number of AH-free graphs", Journal of Graph Theory, 17/1 (1993) 53-63.
16. Hsu, W.L., Ikura, Y., and Nemhauser, G.L., "A polynomial algorithm for maximum weighted vertex packings in graphs without long odd cycles", Math. Programming, 20 (1981) 225-232.
17. LovÃsz, L., and Plummer, M.D., "Matching theory", Annals of Discrete Mathematics, 29 (1986) 471-480.
18. Meyniel, H., "On the perfect graph conjecture", Discrete Mathematics, 16 (1976) 339-342.
19. Minty, G.J., "On maximal independent sets of vertices in claw-free graphs", J. of Combinatorial Theory B, 28 (1980) 284-304.
20. Sbihi, N., "Algorithme de recherche d'un stable de cardinalitÕ maximum dans un graphe sans Õtoile", Discrete Mathematics, 29 (1980) 53-76.