Strongly orderable graphs a common generalization of strongly chordal and chordal bipartite graphs

Discrete Applied Mathematics

Volumn 99, Issue 1-3, 2000, Pages 427-442

  Dragan, Feodor F ^a  

^a UNIVERSITY OF ROSTOCK   (Germany)

Author keywords

Bisimplicial edge without vertex elimination ordering; Chordal bipartite graphs; Greedy algorithms; Maximum clique; Minimum coloring; Recognition; Simple elimination ordering; Strong ordering; Strongly chordal graphs

Indexed keywords

EID: 0346673801     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00149-3     Document Type: Article

References (24)

1. Anstee R.P., Farber M. Characterizations of totally balanced matrices. J. Algorithms. 5:1984;215-230.
2. C. Berge, Färbung von Graphen, deren sämtliche bzw. deren ungerade Kreise starr sind, Wiss. Zeitschr. Martin-Luther-Univ. Halle-Wittenberg, 1961, p. 114.
3. A. Brandstädt, Special graph classes - a survey, Schriftenreihe des Fachbereichs Mathematik, SM-DU-199, Universität Duisburg, 1991.
4. G.J. Chang, Labeling algorithms for domination problems in sun-free chordal graphs, Discrete Appl. Math. 22 (1988 / 89) 21-34.
5. Chang G.J., Nemhauser G.L. The. k -domination and k -stability problems on sun-free chordal graphs SIAM J. Algebra Discrete Methods. 5:1984;332-345.
6. Chvátal V. Perfectly orderable graphs. Ann. Discrete Math. 21:1984;63-65.
7. E. Dahlhaus, M. Karpinski, On the computational complexity of matching and multidimensional matching in chordal and strongly chordal graphs, Technical Report, International Computer Science Institute, Number TR-94-043, August 1994.
8. E. Dahlhaus, Generalized strongly chordal graphs, Technical Report, University of Sydney, Number TR-93-458, 1993.
9. F.F. Dragan, On greedy matching ordering and greedy matchable graphs, in: R.H. Möhring (Ed.), 23rd International Workshop "Graph-Theoretic Concepts in Computer Science" (WG'97), Berlin, Germany, 1997, Lecture Notes in Computer Science, vol. 1335, Springer, Berlin, 1997, pp. 184-198.
10. U. Faigle, O. Goecke, R. Schrader, Church-Rosser decomposition in combinatorial structures, Preprint, Institut für Operation Research, Universität Bonn, 1986.
11. Farber M. Characterizations of strongly chordal graphs. Discrete Math. 43:1983;173-189.
12. Farber M. Domination, independent domination and duality in strongly chordal graphs. Discrete Appl. Math. 7:1984;115-130.
13. Gavril F. Algorithms for minimum coloring, maximum clique, minimum covering by cliques and maximum independent set of a chordal graph. SIAM J. Comput. 1:1972;180-187.
14. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
15. Golumbic M.C., Goss C.F. Perfect elimination and chordal bipartite graphs. J. Graph Theory. 2:1978;155-163.
16. Hayward R. Weakly triangulated graphs. J. Combin. Theory B. 39:1985;200-209.
17. Kloks T., Kratsch D. Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph. Inform. Process. Lett. 55:1995;11-16.
18. B. Korte, L. Lovász, R. Schrader, Greedoids, Springer, Berlin 1991.
19. Lovász L. A characterization of perfect graphs. J. Combin. Theory B. 13:1972;95-98.
20. Lubiw A. Doubly lexical orderings of matrices. SIAM J. Comput. 16:1987;854-879.
21. Paige R., Tarjan R.E. Three partition refinement algorithms. SIAM J. Comput. 16:1987;973-989.
22. Rose D., Tarjan R.E., Lueker G. Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5:1976;266-283.
23. Spinrad J.P. Doubly lexical ordering of dense 0-1 matrices. Inform. Process. Lett. 45:1993;229-235.
24. White K., Farber M., Pulleyblank W. Steiner trees, connected domination and strongly chordal graphs. Networks. 15:1985;109-124.