Isometric embeddings of graphs.
We prove that any finite undirected graph can be canonically embedded isometrically into a maximum cartesian product of irreducible factors.
Graham
R L
RL
AT&T Bell Laboratories, Murray Hill, NJ 07974.
Winkler
P M
PM