1. On the exponent of the all pairs shortest path problem;Alon;Proceedings 32nd Annual IEEE Symposium on Foundations of Computer Science,1991
2. Recognizing binary Hamming graphs in O(n2logn) time;Aurenhammer;Proceedings 16th International Workshop on Graph-Theoretical Concepts in Computer Science,1990
3. Computing equivalence classes among the edges of a graph with tiapplications;Aurenhammer;Discrete Math.,1992
4. Retracts of hypercubes;Bandelt;J. Graph Theory,1984
5. P.K. Jha and G. Slutzki, An O(n2logn) algorithm for recognizing median graphs, submitted.