Isometric universal graphs

Louis Esperet, Cyril Gavoille, Carla Groenland

A subgraph $H$ of a graph $G$ is isometric if the distances between vertices in $H$ coincide with the distances between the corresponding vertices in $G$. We show that for any inte…