Finding a maximum induced matching in weakly chordal graphs

Discrete Mathematics

Volumn 266, Issue 1-3, 2003, Pages 133-142

  Cameron, Kathie ^a   Sritharan, R ^b   Tang, Yingwen ^b  

^a WILFRID LAURIER UNIVERSITY   (Canada)

^b UNIVERSITY OF DAYTON   (United States)

Author keywords

Induced matching; Intersection graphs; Interval filament graphs; Polynomial time algorithm; Strong chromatic index; Strong edge colouring; Strong matching; Weakly chordal graphs

Indexed keywords

EID: 84867926846     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00803-8     Document Type: Conference Paper

References (17)

1. A. Brandstädt, V.B. Le, and J.P. Spinrad Graph Classes - A Survey 1999 SIAM Philadelphia, PA
2. K. Cameron Induced matchings Discrete Appl. Math. 24 1989 97 102
3. K. Cameron, Induced matchings in intersection graphs, Extended abstract, Proceedings of the Sixth International Conference on Graph Theory, Marseille, France, August, 2000; Electron. Notes Discrete Math. 5 (2000), forthcoming.
4. J.-M. Chang, Induced matchings in asteroidal triple-free graphs, Preprint.
5. G. Fricke, and R.C. Laskar Strong matchings on trees Congr. Numer. 89 1992 239 243
6. F. Gavril Maximum weight independent sets and cliques in intersection graphs of filaments Inform. Process. Lett. 73 2000 181 188
7. M.C. Golumbic, and R.C. Laskar Irredundancy in circular arc graphs Discrete Appl. Math. 44 1993 79 89
8. M.C. Golumbic, and M. Lewenstein New results on induced matchings Discrete Appl. Math. 101 2000 157 165
9. M.C. Golumbic, D. Rotem, and J. Urrutia Comparability graphs and intersection graphs Discrete Math. 43 1983 37 46
10. R.B. Hayward Weakly triangulated graphs J. Combin. Theory Ser. B 39 1985 200 209
11. R.B. Hayward, C.T. Hoàng, and F. Maffray Optimizing weakly triangulated graphs Graphs and Combinatorics 5 1989 339 349 erratum in 6 (1990) 33-35
12. R.B. Hayward, J.P. Spinrad, R. Sritharan, Weakly chordal graph algorithms via handles, Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 2000, pp. 42-49.
13. S. Janson, and J. Kratochvl Threshold functions for classes of intersection graphs Discrete Math. 108 1992 307 326
14. C.W. Ko, F.B. Shepherd, Adding an identity to a totally unimodular matrix, LSE Operations Research Working Paper, LSEOR.94.12, 1994.
15. A. Kostochka, and J. Kratochvl Covering and coloring polygon-circle graphs Discrete Math. 163 1997 299 305
16. J.P. Spinrad, and R. Sritharan Algorithms for weakly triangulated graphs Discrete Appl. Math. 19 1995 181 191
17. L.J. Stockmeyer, and V.V. Vazirani NP-completeness of some generalizations of the maximum matching problem Inform. Process. Lett. 15 1982 14 19