LexBFS-orderings and powers of graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1197 LNCS, Issue , 1997, Pages 166-180

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

^a MOLDOVA STATE UNIVERSITY   (Moldova)

^b UNIVERSITY OF DUISBURG ESSEN   (Germany)

^c UNIVERSITY OF ROSTOCK   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CHORDAL GRAPHS; DISTANCE-HEREDITARY; DISTANCE-HEREDITARY GRAPHS; ISOMETRIC SUBGRAPHS; LINEAR-TIME APPROXIMATION; PERFECT ELIMINATION ORDER; UNDIRECTED GRAPH; WEAK BIPOLARIZABLE;

APPROXIMATION ALGORITHMS; COMPUTER SCIENCE; GRAPHIC METHODS;

GRAPH THEORY;

EID: 84896692984     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62559-3_15     Document Type: Conference Paper

References (33)

1. H.J. BANDELT, A. HENKMANN and F. NICOLAI, Powers of distance-hereditary graphs, Discr. Math. 145 (1995), 37-60.
2. H.-J. BANDELT and H.M. MULDER, Distance-hereditary graphs, Journal of Corn-bin. Theory (B) 41 (1986), 182-208.
3. A. BRANDSTÄDT, V.D. CHEPOI and F.F. DRAGAN, Perfect elimination orderings of chordal powers of graphs, Technical Report Gerhard-Mercator- Universität - Gesamthochschule Duisburg SM-DU-252, 1994 (to appear in Discr. Math.).
4. A. BRANDSTÄDT, F.F. DRAGAN, V.D. CHEPOI and V.I. VOLOSHIN, Dually chordal graphs, Proc. of WG'93, Springer, Lecture Notes in Computer Science 790 (1994), 237-251.
5. A. BRANDSTÄDT, F.F. DRAGAN and V.B. LE, Induced cycles and odd powers of graphs, Technical Report Universität Rostock CS-09-95, 1995.
6. A. BRANDSTÄDT, F.F. DRAGAN and F. NICOLAI, LexBFS-orderings and powers of chordal graphs, Technical Report Gerhard-Mercator-Universität - Gesamthochschule Duisburg SM-DU-287, 1995 (to appear in Discr. Math.).
7. R. CHANDRASEKARAN and A. DOUGHETY, Location on tree networks: p-center and q-dispersion problems, Math. Oper. Res. 6 (1981), No. 1, 50-57.
8. G.J. CHANG and G.L. NEMHAUSER, The k-domination and k-stability problems on sun-free chordal graphs, SIAM J. Algebraic and Discrete Methods, 5 (1984), 332-345.
9. G. CHARTRAND and D.C. KAY, A characterization of certain ptolemaic graphs, Canad. Journal Math. 17 (1965), 342-346.
10. V. CHVATAL, Perfectly orderable graphs, Annais of Discrete Math. 21 (1984), 63-65.
11. A. D'ATRI and M. MOSCARINI, Distance-hereditary graphs, Steiner trees and connected domination, SIAM J. Computing 17 (1988), 521-538.
12. F.F. DRAGAN, Dominating cliques in distance-hereditary graphs, Proceedings of SWAT'94, Springer, Lecture Notes in Computer Science 824, 370-381.
13. F.F. DRAGAN and F. NICOLAI, LexBFS-orderings of distance-hereditary graphs, Technical Report Gerhard-Mercator-Universität - Gesamthochschule Duisburg SM-DU-303, 1995.
14. F.F. DRAGAN and F. NICOLAI, LexBFS-orderings and powers of HHD-free graphs, Technical Report Gerhard-Mercator-Universität - Gesamthochschule Duisburg SM-DU-322, 1996.
15. F.F. DRAGAN, F. NICOLAI and A. BRANDSTÄDT, Convexity and HHD-free graphs, Technical Report Gerhard-Mercator-Universität - Gesamthochschule Duisburg SM-DU-290, 1995.
16. F.F. DRAGAN, F. NICOLAI and A. BRANDSTÄDT, Powers of HHD-free graphs, Technical Report Gerhard-Mercator-Universität - Gesamthochschule Duisburg SM-DU-315, 1995.
17. F.F. DRAGAN, CF. PRISACARU and V.D. CHEPOI, Location problems in graphs and the Helly property (in Russian), Discrete Mathematics, Moscow, 4 (1992), 67-73.
18. P. DUCHET, Classical perfect graphs, Annals of Discr. Math. 21 (1984), 67-96.
19. M. FÄRBER and R.E. JAMISON, Convexity in graphs and hypergraphs, SIAM Journal Alg. Discrete Meth. 7, 3 (1986), 433-444.
20. M. GlONFRIDDO, A short survey on some generalized colourings of graphs, Ars Comb. 30 (1986), 275-284.
21. M.C. GOLUMBIC, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York 1980.
22. P.L. HAMMER and F. MAFFRAY, Completely separable graphs, Discr. Appl. Math. 27 (1990), 85-99.
23. E. HOWORKA, A characterization of distance-hereditary graphs, Quart. J. Math. Oxford Ser. 2, 28 (1977), 417-420.
24. E. HOWORKA, A characterization of ptolemaic graphs, Journal of Graph Theory 5 (1981), 323-331.
25. B. JAMISON and S. OLARIU, On the semi-perfect elimination, Advances in App Ued Math. 9 (1988), 364-376.
26. T.R. JENSEN and B. TOFT, Graph coloring problems, Wiley 1995.
27. T. KLOKS, D. KRATSCH and H. MÜLLER, Approximating the bandwidth for AT-free graphs, Proceedings of European Symposium on Algorithms ESA'95, Springer, Lecture Notes in Computer Science 979 (1995), 434-447.
28. R. LASKAR and D.R. SHIER, On powers and centers of chordal graphs, Discr. Appl. Math. 6 (1983), 139-147.
29. F. NICOLAI, A hypertree characterization of distance-hereditary graphs, Technical Report Gerhard-Mercator-Universität - Gesamthochschule Duisburg SM-DU-255 1994.
30. F. NICOLAI, Hamiltonian problems on distance-hereditary graphs, Technical Report Gerhard-Mercator-Universität - Gesamthochschule Duisburg SM-DU-264, 1994.
31. S. OLARIU, Weak bipolarizable graphs, Discr. Math. 74 (1989), 159-171.
32. D. ROSE, R.E. TARJAN and G. LUEKER, Algorithmic aspects on vertex elimination on graphs, SIAM J. Computing 5 (1976), 266-283.
33. R.E. TARJAN and M. YANNAKAKIS, Simple linear time algorithms to test chordal-ity of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hyper-graphs, SIAM J. Computing 13, 3 (1984), 566-579.