There are no finite partial cubes of girth more than 6 and minimum degree at least 3

On the Addressing Problem for Loop Switching

R. L. Graham, H. O. Pollak · Bell System Technical Journal · 1971 · 493 citations

Computing, Communication, Computer Science +11

Isometric embedding in products of complete graphs

Peter Winkler · Discrete Applied Mathematics · 1984 · 217 citations

Natural Sciences, Architectural Representation, Graph Visualization +5

Retracts of hypercubes

H. -J. Bandelt · Journal of Graph Theory · 1984 · 96 citations

Natural Sciences, Computer Science, Mathematics +9

<i>n</i>‐cubes and median graphs

Henry Martyn Mulder · Journal of Graph Theory · 1980 · 80 citations

Natural Sciences, Computer Science, Mathematics +9

Cut Method: Update on Recent Developments and Equivalence of Independent Approaches

Sandi Klavžar, M.J. Nadjafi-Arani · Current Organic Chemistry · 2014 · 65 citations

Natural Sciences, Computer Science, Computational Chemistry +16