A Helly theorem in weakly modular space

Discrete Mathematics

Volumn 160, Issue 1-3, 1996, Pages 25-39

  Bandelt, Hans Jürgen ^a   Chepoi, Victor ^b  

^a UNIVERSITY OF HAMBURG   (Germany)

^b Catedra de Cibernetica Matemat   (Moldova)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0011363468     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00217-K     Document Type: Article

References (30)

1. R.P. Anstee and M. Farber, On bridged graphs and cop-win graphs, J. Combin. Theory Ser. B 44 (1988) 22-28.
2. H.-J. Bandelt, Networks with Condorcet solutions, Europ. J. Oper. Res. 20 (1985) 314-326.
3. H.-J. Bandelt and J. Hedliková, Median algebras, Discrete Math. 45 (1983) 1-30.
4. H.-J. Bandelt and H.M. Mulder, Pseudo-modular graphs, Discrete Math. 62 (1986) 245-260.
5. H.-J. Bandelt and H.M. Mulder, Distance-hereditary graphs, J. Combin. Theory Ser. B 41 (1986) 182-208.
6. H.-J. Bandelt and H.M. Mulder, Helly theorems for dismantlable graphs and pseudo-modular graphs, in: R. Bodendiek and R. Henn, eds, Topics in Combinatorics and Graph Theory (Physica-Verlag, Heidelberg, 1990) 65-71.
7. H.-J. Bandelt and H.M. Mulder, Pseudo-median graphs: decomposition via amalgamation and Cartesian multiplication, Discrete Math. 94 (1991) 161-180.
8. H.-J. Bandelt and H.M. Mulder, Cartesian factorization of interval-regular graphs having no long isometric odd cycles, in: Y. Alavi, G. Chartrand, O.R. Oellermann and A.J. Schwenk, eds, Graph Theory, Combinatorics, and Applications, vol. 1 (Wiley, New York, 1991) 55-75.
9. H.-J. Bandelt, M. van de Vel and E. Verheul, Modular interval spaces, Math. Nachr. 163 (1993) 177-201.
10. V.D. Chepoi, Some properties of d-convexity in triangulated graphs, Mat. Issledovanija 87 (1986) 164-177 (in Russian).
11. V.D. Chepoi, Classifying graphs by metric triangles, Metody Diskretnogo Analiza 49 (1989) 75-93 (in Russian).
12. V.D. Chepoi, d-Convexity and local conditions on graphs, Issledovanija Priklad. Mat. i Inf. (Ştiinţa, Chişinǎu 1990) 184-191 (in Russian).
13. F.R.K. Chung, R. Graham and M.E. Saks, A dynamic location problem for graphs, Combinatorica 9 (1989) 111-131.
14. F.F. Dragan and V.D. Chepoi, Properties of pseudo-modular graphs, Issled. Oper. i ASU (Kiev) 37 (1991) 47-54 (in Russian).
15. P. Duchet, Convex sets in graphs II: minimal path convexity, J. Combin. Theory Ser. B 44 (1988) 307-316.
16. P. Duchet and H. Meyniel, Ensembles convexes dans les graphes I: théorèmes de Helly et de Radon pour graphes et surfaces, European J. Combin. 4 (1983) 127-132.
17. M. Farber and R.E. Jamison, On local convexity in graphs, Discrete Math. 66 (1987) 231-247.
18. J. Hedliková, Ternary spaces, media, and Chebyshev sets, Czechoslovak Math. J. 33 (1983) 373-389.
19. R.E. Jamison, Partition numbers for trees and ordered sets, Pacific J. Math. 96 (1981) 115-140.
20. R.E. Jamison and R. Nowakowski, A Helly theorem for convexity in graphs, Discrete Math. 51 (1984) 35-39.
21. H.M. Mulder, The interval function of a graph, Math. Centre Tracts, vol. 132 (Amsterdam, 1980).
22. R. Nowakowski and P. Winkler, Vertex-to-vertex pursuit in a graph, Discrete Math. 43 (1983) 235-239.
23. E. Pesch, Retracts of Graphs (Athenäum Verlag, Frankfurt, 1988).
24. P.S. Soltan and V.D. Chepoi, Solution of the Weber problem for discrete median metric spaces, Trudy Tbiliss. Mat. Inst. 85 (1987) 53-76 (in Russian).
25. V.P. Soltan, Introduction to the Axiomatic Theory of Convexity (Ştiinţa, Chişinǎu, 1984) (in Russian).
26. V.P. Soltan and V.D. Chepoi, Conditions for invariance of set diameters under d-convexification in a graph, Cybernetics 19 (1983) 750-756.
27. M. van de Vel, Theory of Convex Structures (Elsevier, Amsterdam, 1993).
28. E. Verheul, Multimedians in metric and normed spaces, Dissertation, Vrije Universiteit, Amsterdam, 1991.
29. E. Wilkeit, Isometric embedding in Hamming graphs, J. Combin. Theory Ser. B 50 (1990) 179-197.
30. E. Wilkeit, The retracts of Hamming graphs, Discrete Math. 102 (1992) 197-218.