Perfect elimination orderings of chordal powers of graphs

Discrete Mathematics

Volumn 158, Issue 1-3, 1996, Pages 273-278

  Brandstädt, Andreas ^a   Chepoi, Victor D ^b   Dragan, Feodor F ^b  

^a UNIVERSITY OF ROSTOCK   (Germany)

^b MOLDOVA STATE UNIVERSITY   (Moldova)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041593632     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00081-7     Document Type: Article

References (11)

1. H.-J. Bandelt, A. Henkmann and F. Nicolai, Powers of distance-hereditary graphs, Technical Report SM-DU-220, University of Duisburg, 1993.
2. A. Brandstädt, F.F. Dragan, V.D. Chepoi and V.I. Voloshin, Dually chordal graphs, Technical Report SM-DU-225, University of Duisburg 1993, in: Lecture Notes in Computer Science, Vol. 790, Proc. of WG'93, Utrecht, The Netherlands, Springer, J. van Leeuwen, ed. (1994) 237-251, submitted to SIAM J. Discr. Math.
3. A. Brandstädt, F.F. Dragan, V.D. Chepoi and V.I. Voloshin, Dually chordal graphs, Technical Report SM-DU-225, University of Duisburg 1993, in: Lecture Notes in Computer Science, Vol. 790, Proc. of WG'93, Utrecht, The Netherlands, Springer, J. van Leeuwen, ed. (1994) 237-251, submitted to SIAM J. Discr. Math.
4. P. Buneman, A characterization of rigid circuit graphs, Discr. Math. 9 (1974) 205-212.
5. E. Dahlhaus and P. Duchet, On strongly chordal graphs, Ars Combin. 24B (1987) 23-30.
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. Discr. Meth. 7 (1986) 433-444.
8. R. Laskar and D.R. Shier, On powers and centers of chordal graphs, Discr. Appl. Math. 6 (1983) 139-147.
9. A. Lubiw, Γ-free matrices, M.S. Thesis, Dept. of Comb. and Optim., Univ. of Waterloo, Canada, 1982.
10. D.R. Shier, Some aspects of perfect elimination orderings in chordal graphs, Discr. Appl. Math. 7 (1984) 325-331.
11. 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.