It is often convenient to work with the graphical small cancellation as it provides either coarse or isometric embeddings - and the details of this can be seen nicely in the thesis work of Gruber, which appears in [1]}. However, if one is interested in producing examples with property (T) currently one needs to use the method of Gromov [2]}. The graphical C(7) labellings, which exist due to Osajda [3]} can also be obtained for graphs that satisfy a wall type structure as considered in Arzhantseva–Osajda [4]}, and this means that the results of [4]} can be applied to obtain groups that are not property (A), but do have the Haagerup property. This end of the spectrum is of less interest to us in this paper purely because it subsumes the direct calculations we perform to obtain the isomorphism of classical Baum–Connes assembly, due to the work of Higson–Kasparov [6]}.
