An Euler-type formula for median graphs

Discrete Mathematics

Volumn 187, Issue 1-3, 1998, Pages 255-258

  Klavžar, Sandi ^a   Mulder, Henry Martyn ^b   Škrekovski, Riste ^c  

^a UNIVERSITY OF MARIBOR   (Slovenia)

^b ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

^c UNIVERSITY OF LJUBLJANA   (Slovenia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037729864     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(98)00019-3     Document Type: Article

References (9)

1. D. Djoković, Distance preserving subgraphs of hypercubes, J. Combin. Theory Ser. B 14 (1973) 263-267.
2. R.L. Graham, P.M. Winkler, On isometric embeddings of graphs, Trans. Amer. Math. Soc. 288 (1985) 527-536.
3. W. Imrich, S. Klavžar, A simple O(mn) algorithm for recognizing Hamming graphs, Bull. Inst. Comb. Appl. 9 (1993) 45-56.
4. S. Janaqi, Quelques elements de la theorie des graphes, These Université. Joseph Fourier, Mediatheque, IMAG, Grenoble, 1995.
5. S. Klav̌zar, H.M. Mulder, Median graphs: characterizations, location theory and related structures. Report 9641, Report Erasmus Universiteit, 1996, pp. 20, J. Combin. Math. Combin. Comp., in press.
6. H.M. Mulder, The structure of median graphs, Discrete Math. 24 (1978) 197-204.
7. H.M. Mulder, The Interval Function of a Graph, Mathematical Centre Tracts 132, Mathematisch Centrum, Amsterdam, 1980.
8. H.M. Mulder, The expansion procedure for graphs in: R. Bodendiek (ed.), Contemporary Methods in Graph Theory, Wissenschaftsverlag, Mannheim, 1990, pp. 459-477.
9. P. Winkler, Isometric embeddings in products of complete graphs, Discrete Appl. Math. 7 (1984) 221-225.