Isometric embeddings of graphs

AUTOR(ES)

Graham, R. L.

RESUMO

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

Documentos Relacionados

• Isometric embeddings of the hyperbolic plane in Euclidean spaces
• Characteristic classes, singular embeddings, and intersection homology
• Mergulhos graduados de PI-algebras
• Measures of irregularity of graphs
• SOME REMARKS ON AUTOMORPHISMS, ANALYTIC BUNDLES, AND EMBEDDINGS OF COMPLEX ALGEBRAIC VARIETIES