Amalgamation Classes with $\exists$-Resolutions

Justin Brody

Let $K_d$ denote the class of all finite graphs and, for graphs $A\subseteq B$, say $A{\le }_{d}B$ if distances in $A$ are preserved in $B$; i.e. for $a,a^{\prime }\in A$ the length of the…