Convexity and HHD-free graphs

SIAM Journal on Discrete Mathematics

Volumn 12, Issue 1, 1999, Pages 119-135

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

^a UNIVERSITY OF ROSTOCK   (Germany)

^b UNIVERSITY OF DUISBURG ESSEN   (Germany)

^c Universitatea de Stat din Moldova   (Moldova)

Author keywords

Antimatroid; Chordal graphs; Convex geometry; Convexity; Dominating clique problem; HHD free graphs; Lexicographic breadth first search; Semisimplicial ordering; Weak bipolarizable graphs

Indexed keywords

EID: 0042482676     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480195321718     Document Type: Article

References (28)

1. A. BRANDSTÄDT, V.D. CHEPOI, AND F.F. DRAGAN, Perfect elimination orderings of chordal powers of graphs, Discrete Math., 158 (1996), pp. 273-278.
2. A. BRANDSTÄDT AND D. KRATSCH, Domination problems on permutation and other graphs, Theoret. Comput. Sci., 54 (1987), pp. 181-198.
3. G.J. CHANG AND G.L. NEMHAUSER, The k-domination and k-stability problems on sun-free chordal graphs, SIAM J. Algebraic Discrete Meth., 5 (1984), pp. 332-345.
4. V.D. CHEPOI, d-Convex Sets in Graphs, Ph.D. dissertation, Moldova State University, Kishinev, 1986 (Russian).
5. V.D. CHEPOI, Centers of triangulated graphs, Math. Notes, 43 (1988), pp. 143-151 (Russian, English transl.).
6. V.D. CHEPOI AND F.F. DRAGAN, Linear-time algorithm for finding a central vertex of a chordal graph, Algorithms - ESA'94, 2nd Annual European Symposium, Utrecht, The Netherlands, 1994 Lecture Notes in Comput. Sci. 855, Jan van Leeuwen, ed., Springer, Berlin, New York, 1994, pp. 159-170.
7. G.A. DIRAC, On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg, 25 (1961), pp. 71-76.
8. F.F. DRAGAN, Dominating cliques in distance-hereditary graphs, Algorithm Theory - SWAT'94, 4th Scandinavian Workshop on Algorithm Theory, Aarhus, Denmark, 1994, Lecture Notes in Comput. Sci. 824, Erik M. Schmidt and Sven Skyum, eds., Springer, Berlin, New York, 1994, pp. 370-381.
9. F.F. DRAGAN AND A. BRANDSTÄDT, r-dominating cliques in graphs with hypertree structure, Discrete Math., 162 (1996), pp. 93-108.
10. F.F. DRAGAN AND F. NICOLAI, r-domination problems on homogeneously orderable graphs, Networks, 30 (1997), pp. 121-131.
11. F.F. DRAGAN, F. NICOLAI, AND A. BRANDSTÄDT, Convexity and HHD-free graphs, Abstracts of the 5th Internat. Colloq. on "Graphs and Combinatorics," Marseille Luminy, September 3-8, 1995, p. 17.
12. P. DUCHET, Convex sets in graphs II: Minimal path convexity, J. Combin. Theory Ser. B, 44 (1988), pp. 307-316.
13. P. DUCHET AND H. MEYNIEL, Ensemble convexes dans les graphes I, European J. Combin., 4 (1983), pp. 127-132.
14. M. FARDER, Bridged graphs and geodesic convexity, Discrete Math., 66 (1987), pp. 249-257.
15. M. FARBER, On diameters and radii of bridged graphs, Discrete Math., 73 (1989), pp. 249-260.
16. M. FARBER AND R.E. JAMISON, Convexity in graphs and hypergraphs, SIAM J. Algebraic Discrete Meth., 7 (1986), pp. 433-444.
17. M. FARBER AND R.E. JAMISON, On local convexity in graphs, Discrete Math., 66 (1987), pp. 231-247.
18. M.C. GOLUMBIC, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
19. B. JAMISON AND S. OLARIU, On the semi-perfect elimination, Adv. Appl. Math., 9 (1988), pp. 364-376.
20. R.E. JAMISON, A perspective on abstract convexity: Classifying alignment by varieties, in Convexity and Related Combinatorial Geometry, D.C. Kay and M. Breen, eds., Marcel Dekker, New York, 1982.
21. B. KORTE, L. LOVÁSZ, AND R. SCHRADER, Greedoids, Springer-Verlag, Berlin, Heidelberg, New York, 1991.
22. H.M. MULDER, The Interval Function of a Graph, preprint, Math. Centre Tracts 132, Math. Centrum, Amsterdam, 1980.
23. S. OLARIU, Weak bipolarizable graphs, Discrete Math., 74 (1989), pp. 159-171.
24. D. ROSE, Triangulated graphs and the elimination process, J. Math. Anal. Appl., 32 (1970), pp. 579-609.
25. D. ROSE, R.E. TARJAN, AND G. LUEKER, Algorithmic aspects on vertex elimination on graphs, SIAM J. Comput., 5 (1976), pp. 266-283.
26. V.P. SOLTAN, d-convexity in graphs, Soviet Math. Dokl., 28 (1983), pp. 419-421.
27. V.P. SOLTAN AND V.D. CHEPOI, Conditions for invariance of set diameters under d-convexification in a graph, Cybernetics, 19 (1983), pp. 750-756.
28. 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., 3 (1984), pp. 566-579.