Isometric embeddings of graphs

  • Graham R
  • Winkler P
N/ACitations
Citations of this article
12Readers
Mendeley users who have this article in their library.

Abstract

We prove that any finite undirected graph can be canonically embedded isometrically into a maximum cartesian product of irreducible factors.

Cite

CITATION STYLE

APA

Graham, R. L., & Winkler, P. M. (1984). Isometric embeddings of graphs. Proceedings of the National Academy of Sciences, 81(22), 7259–7260. https://doi.org/10.1073/pnas.81.22.7259

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free