A convexity lemma and expansion procedures for bipartite graphs

European Journal of Combinatorics

Volumn 19, Issue 6, 1998, Pages 677-685

  Imrich, Wilfried ^a   Klavžar, Sandi ^b  

^a UNIVERSITY OF LEOBEN   (Austria)

^b UNIVERSITY OF MARIBOR   (Slovenia)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (21)

1. 2 log n) time, in: Proceedings of the 16th International Workshop on Graph Theoretical Concepts in Computer Science, Lecture Notes in Computer Science, 484, Springer-Verlag, New York, 1991, pp. 90-98. Also: Math. Systems Theory, 28 (1995), 387-395.
2. 2 log n) time, in: Proceedings of the 16th International Workshop on Graph Theoretical Concepts in Computer Science, Lecture Notes in Computer Science, 484, Springer-Verlag, New York, 1991, pp. 90-98. Also: Math. Systems Theory, 28 (1995), 387-395.
3. H.-J. Bandelt, Characterizing median graphs, manuscript, 1982.
4. H.-J. Bandelt, H.M. Mulder, and E. Wilkeit, Quasi-median graphs and algebras, J. Graph Theory, 18 (1994), 681-703.
5. H.-J. Bandelt and V. Chepoi, Graphs of acyclic cubical complexes, Eur. J. Combin., 17 (1996), 113-120.
6. J.-P. Barthélemy and J. Constantin, Median graphs, parallelism and posets, Discrete Math., 111 (1993), 49-63.
7. K.V.S. Bhat, On the complexity of testing a graph for n-cube, Inform. Process. Lett., 11 (1980), 16-19.
8. V. Chepoi, d-Convexity and isometric subgraphs of Hamming graphs, Cybernetics, 1 (1988), 6-9.
9. V. Chepoi, Separation of two convex sets in convexity structures, J. Geom., 50 (1994), 30-51.
10. D. Djoković, Distance preserving subgraphs of hypercubes, J. Combin. Theory Ser. B, 14 (1973), 263-267.
11. R.L. Graham, On primitive graphs and optimal vertex assignments, Ann. NY Acad. Sci., 175 (1970), 170-186.
12. R.L. Graham and P.M. Winkler, On isometric embeddings of graphs, Trans. Am. Math. Soc., 288 (1985), 527-536.
13. J. Hagauer, W. Imrich, and S. Klavžar, Recognizing median graphs in subquadratic time, Theoret. Comput. Sci., in press.
14. W. Imrich and S. Klavžar, A simple O (mn) algorithm for recognizing Hamming graphs, Bull. Inst. Comb. Appl., 9 (1993), 45-56.
15. W. Imrich and S. Klavžar, On the complexity of recognizing Hamming graphs and related classes of graphs, Eur. J. Combin., 17 (1996), 209-221.
16. P.K. Jha and G. Slutzki, Convex-expansions algorithms for recognizing and isometric embedding of median graphs, Ars Combin., 34 (1992), 75-92.
17. S. Klavžar and H.M. Mulder, Median graphs: characterizations, location theory and related structures, J. Combin. Math. Combin. Comput., in press.
18. H.M. Mulder, The structure of median graphs, Discrete Math., 24 (1978), 197-204.
19. H.M. Mulder, The Interval Function of a Graph, Mathematical Centre Tracts, 132, Mathematisch Centrum, Amsterdam, 1980.
20. H.M. Mulder, The expansion procedure for graphs, in: Contemporary Methods in Graph Theory, R. Bodendiek (ed.), B.I.-Wissenschaftsverlag, Mannheim/Wien/Zürich, 1990, 459-477.
21. P. Winkler, Isometric embeddings in products of complete graphs, Discrete Appl. Math., 7 (1984), 221-225.