LexBFS-orderings and powers of chordal graphs

Discrete Mathematics

Volumn 171, Issue 1-3, 1997, Pages 27-42

  Brandstädt, Andreas ^a   Dragan, Feodor F ^b   Nicolai, Falk ^c  

^a UNIVERSITY OF ROSTOCK   (Germany)

^b MOLDOVA STATE UNIVERSITY   (Moldova)

^c UNIVERSITY OF DUISBURG ESSEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039967622     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00070-2     Document Type: Article

References (14)

1. A. Brandstädt, Special graph classes - a survey, Tech. Report Gerhard-Mercator-Universität -Gesamthochschule Duisburg SM-DU-199, 1991.
2. A. Brandstädt, V.D. Chepoi and F.F. Dragan, Perfect elimination orderings of chordal powers of graphs, Tech. Report Gerhard-Mercator-Universität - Gesamthochschule Duisburg SM-DU-252, 1994 Discrete Math., to appear.
3. A. Brandstädt, F.F. Dragan, V.D. Chepoi and V.I. Voloshin, Dually chordal graphs, in: J. van Leeuwen, ed., Proc. of WG'93, Utrecht, The Netherlands, Lecture Notes in Computer Science, Vol. 790 (Springer, Berlin, 1994) 237-251.
4. F.F. Dragan and A. Brandstädt, r-dominating cliques in Helly graphs and chordal graphs, Tech. Report Gerhard-Mercator-Universität - Gesamthochschule Duisburg SM-DU-228, 1993, Proc. of the 11th STACS, Caen, France, Lecture Notes in Computer Science, Vol. 775 (Springer, Berlin, 1994) 735-746.
5. F.F. Dragan, C.F. Prisacaru and V.D. Chepoi, Location problems in graphs and the Helly property (in Russian), Discrete Math. 4 (1992), 67-73 (the full version appeared as preprint: F.F. Dragan, C.F. Prisacaru and V.D. Chepoi, r-Domination and p-center problems on graphs: special solution methods and graphs for which this method is usable (in Russian), Kishinev State University, preprint MoldNIINTI, N. 948-M88, 1987).
6. P. Duchet, Classical perfect graphs, Ann. Discr. Math. 21 (1984) 67-96.
7. M. Farber and R.E. Jamison, Convexity in graphs and hypergraphs, SIAM J. Alg. Discrete Methods 7 (1986) 433-444.
8. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York, 1980).
9. B. Jamison and S. Olariu, On the semi-perfect elimination, Adv. Appl. Math. 9 (1988) 364-376.
10. R. Laskar and D.R. Shier, On powers and centers of chordal graphs, Discrete Appl. Math. 6 (1983) 139-147.
11. A. Lubiw, Γ-free matrices, M.S. Thesis, Dept. of Comb. and Optim., Univ. of Waterloo, Canada, 1982.
12. D. Rose, R.E. Tarjan and G. Lueker, Algorithmic aspects on vertex elimination on graphs, SIAM J. Comput. 5 (1976) 266-283.
13. T. Szymczak, personal communication.
14. R.E. Tarjan and M. Yannakakis, Simple linear time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Comput. 13 (1984) 566-579.