Quasi-median graphs, their generalizations, and tree-like equalities

European Journal of Combinatorics

Volumn 24, Issue 5, 2003, Pages 557-572

  Brešar, Boštjan ^a   Klavžar, Sandi ^a   Škrekovski, Riste ^b  

^a UNIVERSITY OF MARIBOR   (Slovenia)

^b UNIVERSITY OF LJUBLJANA   (Slovenia)

Author keywords

Euler type formula; Expansion procedure; Partial Hamming graph; Quasi median graph; Quasi semimedian graph; Tree like equality

Indexed keywords

EID: 0038336367     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0195-6698(03)00045-3     Document Type: Article

References (33)

1. Bandelt H.-J. Mulder H.M. Wilkeit E. Quasi-median graphs and algebras J. Graph Theory 18 1994 681-703
2. 1-embedding of weakly median graphs European J. Combin. 21 2000 701-714
3. Brešar B. Partial Hamming graphs and expansion procedures Discrete Math. 237 2001 13-27
4. Brešar B. Imrich W. Klavžar S. Mulder H.M. Škrekovski R. Tiled partial cubes J. Graph Theory 40 2002 91-103
5. Brešar B. Klavžar S. Škrekovski R. The cube polynomial and its derivatives: the case of median graphs Electron. J. Combin. 10 R3 2003 11
6. Chastand M. Retracts of infinite Hamming graphs J. Combin. Theory Ser. B 71 1997 54-66
7. Chastand M. Polat N. Invariant Hamming graphs in infinite quasi-median graphs Discrete Math. 160 1996 93-104
8. Chepoi V. Isometric subgraphs of Hamming graphs and d-convexity Cybernetics 1 1988 6-11
9. Chepoi V. Classifying graphs by means of metric triangles Metody Diskret. Anal. 49 1989 75-93 (in Russian)
10. Chepoi V. Separation of two convex sets in convexity structures J. Geom. 50 1994 30-51
11. Chung F.R.K. Graham R.L. Saks M.E. Dynamic search in graphs Johnson D.S. Nishizeki T. Takao N. Wilf H.S. Discrete Algorithms and Complexity 1987 351-388 Academic Press San Diego
12. Chung F.R.K. Graham R.L. Saks M.E. A dynamic location problem for graphs Combinatorica 9 1989 111-131
13. Djoković D.Ž. Distance-preserving subgraphs of hypercubes J. Combin. Theory Ser. B 14 1973 263-267
14. Feder T. Product graph representations J. Graph Theory 16 1992 467-488
15. Graham R. Pollak H. On addressing problem for loop switching Bell System Tech. J. 50 1971 2495-2519
16. Graham R.L. Winkler P.M. On isometric embeddings of graphs Trans. Amer. Math. Soc. 288 1985 527-539
17. Hagauer J. Skeletons, recognition algorithm and distance matrix of quasi-median graphs Int. J. Comput. Math. 55 1995 155-171
18. Imrich W. Klavžar S. A convexity lemma and expansion procedures for bipartite graphs European J. Combin. 19 1998 677-685
19. Imrich W. Klavžar S. Product Graphs: Structure and Recognition 2000 Wiley New York
20. Imrich W. Klavžar S. Mulder H.M. Median graphs and triangle-free graphs SIAM J. Discrete Math. 12 1999 111-118
21. Klavžar S. Mulder H.M. Median graphs: characterizations, location theory and related structures J. Combin. Math. Combin. Comput. 30 1999 103-127
22. Klavžar S. Mulder H.M. Škrekovski R. An Euler-type formula for median graphs Discrete Math. 187 1998 255-258
23. Klavžar S. Škrekovski R. On median graphs and median grid graphs Discrete Math. 219 2000 287-293
24. Mulder H.M. The structure of median graphs Discrete Math. 24 1978 197-204
25. Mulder H.M. The Interval Function of a Graph: Mathematical Centre Tracts 132 1980 Mathematisch Centrum Amsterdam
26. Mulder H.M. The expansion procedure for graphs Bodendiek R. Contemporary Methods in Graph Theory 1990 459-477 B.I.-Wissenschaftsverlag Manhaim/Wien/Zürich
27. Škrekovski R. Two relations for median graphs Discrete Math. 226 2001 351-353
28. Soltan P.S. Chepoi V. Solution of the Weber problem for discrete median metric spaces Tr. Tbiliss. Mat. Inst. Razmadze Akad. Nauk Gruzin. SSR 85 1987 52-76 (in Russian)
29. Tardif C. Prefibers and the Cartesian product of metric spaces Discrete Math. 109 1992 283-288
30. Vesel A. Recognizing pseudo-median graphs Discrete Appl. Math. 116 2002 261-269
31. Wilkeit E. Isometric embeddings in Hamming graphs J. Combin. Theory Ser. B 50 1990 179-197
32. Wilkeit E. The retracts of Hamming graphs Discrete Math. 102 1992 197-218
33. P.M. Winkler, Isometric embedding in products of complete graphs, Discrete Appl. Math. 7 (1984) 221-225.