Decomposition and l1-Embedding of Weakly Median Graphs

European Journal of Combinatorics

Volumn 21, Issue 6, 2000, Pages 701-714

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

^a UNIVERSITY OF HAMBURG   (Germany)

^b BIELEFELD UNIVERSITY   (Germany)

^c AIX MARSEILLE UNIVERSITY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034371174     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1006/eujc.1999.0377     Document Type: Article

References (28)

1. R. P. Anstee and M. Farber, On bridged graphs and cop-win graphs, J. Comb. Theory, Ser. B, 44 (1988), 22-28.
2. P. Assouad, Embeddability of regular polytopes and honeycombs in hypercubes, in: The Geometric Vein:, The Coxeter Festschrift, Springer, Berlin, 1981, pp. 141-147.
3. P. Assouad and M. Deza, Espaces métriques plongeables dans un hypercube: aspects combinatoires, Ann. Discrete Math., 8 (1980), 197-210.
4. H.-J. Bandelt and V. Chepoi, Cellular bipartite graphs, Europ. J. Combinatorics, 17 (1996), 121-134.
5. H.-J. Bandelt and A. W.M. Dress, A canonical decomposition theory for metrics on a finite set, Adv. Math., 92 (1992), 47-105.
6. H.-J. Bandelt and H. M. Mulder, Pseudo-median graphs: decomposition via amalgamation and Cartesian multiplication, Discrete Math., 94 (1991), 161-180.
7. H.-J. Bandelt and H. M. Mulder, Cartesian factorization of interval-regular graphs having no long isometric odd cycles, in: Graph Theory, Combinatorics, and Applications, volume 1, Y. Alavi, G. Chartrand, O. R. Oellermann and A. J. Schwenk (eds), Wiley, New York, 1991, pp. 55-75.
8. H.-J. Bandelt, H. M. Mulder and E. Wilkeit, Quasi-median graphs and algebras, J. Graph Theory, 18 (1994), 681-703.
9. H.-J. Bandelt and E. Pesch, Dismantling absolute retracts of reflexive graphs, Europ. J. Combinatorics, 10 (1989), 211-220.
10. V. Chepoi, Classifying graphs by means of metric triangles (in Russian), Metody Diskret. Analiza, 49 (1989), 75-93.
11. V. Chepoi, d-Convexity and local conditions on graphs (in Russian), Issledovania po Prikladnoj Matematike i Informatike, Chişinǎu, Stiinţa, (1990), 184-191.
12. V. Chepoi, Separation of two convex sets in convexity structures, J. Geom., 50 (1994), 30-51.
13. V. Chepoi, Bridged graphs are cop-win graphs: an algorithmic proof, J. Comb. Theory, Ser. B, 69 (1997), 97-100.
14. F. R. K. Chung, R. L. Graham and M. E. Saks, A dynamic location problem for graphs, Combinatorica, 9 (1989), 111-131.
15. 1-Rigid graphs, J. Algebr. Comb., 3 (1994), 153-175.
16. M. Deza and M. Laurent, Geometry of Cuts and Metrics, Springer-Verlag, Berlin, 1997.
17. D. Ž. Djoković, Distance-preserving subgraphs of hypercubes, J. Comb. Theory, Ser. B, 14 (1973), 263-267.
18. A. W. M. Dress and R. Scharlau, Gated sets in metric spaces, Aeq. Math., 34 (1987), 112-120.
19. P. Duchet, M. Las Vergnas and H. Meyniel, Connected cutsets of a graph and triangle bases of the cycle space, Discrete Math., 62 (1986), 145-154.
20. M. Farber and R. E. Jamison, On local convexity in graphs, Discrete Math., 66 (1987), 231-247.
21. J. R. Isbell, Median algebra, Trans. Am. Math. Soc., 260 (1980), 319-362.
22. R. E. Jamison, On the null-homotopy of bridged graphs, Europ. J. Combinatorics, 8 (1987), 421-428.
23. H. M. Mulder, The interval function of a graph, Math. Centre Tracts, 132, Amsterdam, 1980.
24. S. V. Shpectorov, On scale embeddings of graphs into hypercubes, Europ. J. Combinatorics, 14 (1993), 117-130.
25. V. P. Soltan and V. D. Chepoi, Conditions for invariance of set diameters under d-convexification in a graph, Cybernetics, 19 (1983), 750-756.
26. M. van de Vel, Matching binary convexities, Topology Appl., 16 (1983), 207-235.
27. M. L.J. van de Vel, Theory of Convex Structures, North-Holland, Amsterdam, 1993.
28. E. Wilkeit, The retracts of Hamming graphs, Discrete Math., 102 (1992), 197-218.