Weighted parameters in (P5,P̄5)-free graphs

Discrete Applied Mathematics

Volumn 80, Issue 2-3, 1997, Pages 255-261

  Giakoumakis, Vassilis ^a   Rusu, Irena ^b  

^a AMIENS UNIVERSITY HOSPITAL   (France)

^b UNIVERSITÉ D'ORLÉANS   (France)

Author keywords

Modular decomposition; Perfect graphs; Weighted parameters

Indexed keywords

EID: 0008488831     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(97)00093-0     Document Type: Article

References (9)

1. H. Buer, R.H. Möhring, A fast algorithm for the decomposition of graphs and posets, Math. Oper. Res. 8 (1983) 170-184.
2. A. Cournier, M. Habib, A new linear Algorithm for Modular Decomposition, Lecture Notes in Computer Science, vol. 787, Springer, Berlin, 1994, pp. 68-84.
3. E. Dalhaus, J. Gustedt, R.M. McConnel, Efficient and practical odular decomposition, in: Proc. 8th ACM-SIAM Symp. Discrete Algorithms, 1997, pp. 26-35.
4. 5, Discrete Math. 146 (1995) 33-44.
5. M.C. Golumbic, Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
6. M. Grötschel, L. Lovász, A. Schrijver, Polynomial algorithms for perfect graphs, in: C. Berge, V. Chvátal (Eds.), Topics on Perfect graphs, Math. Stud., vol. 88, 1984, pp. 325-356.
7. C.T. Hoàng, Efficient algorithms for minimum weighted colouring of some classes of perfect graphs, Discrete Appl. Math. 55 (1994) 133-143.
8. C.T. Hoàng, F. Maffray, S. Olariu, M. Preissmann, A charming class of perfectly orderable graphs, Discrete Math. 102 (1992) 67-74.
9. R.M. McConnel, J. Spinrad, Linear-time modular decomposition algorithm and efficient transitive orientation of undirected graphs, in: Proc. 5th ACM-SIAM Symp. Discrete Algorithms, 1994, pp. 536-545.