We prove that any finite undirected graph can be canonically embedded isometrically into a maximum cartesian product of irreducible factors.
CITATION STYLE
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
Mendeley helps you to discover research relevant for your work.