Once one has labelled finite graphs where the labellings satisfying a small cancellation condition, the general machinery of small cancellation theory gives rise to an embedding of the graphs into the resulting finitely generated infinite group. The strength of this embedding depends on the controls provided by the corresponding Van Kampen type theorem that appears for that particular type of labelling. The range is from weak embeddings [1]}, or almost quasi-isometric embeddings at a large scale [2]}, [3]}, or all the way through to isometric embeddings [2]}, [5]}, [6]}.
