Injective hulls of various graph classes

Heather M. Guarnera, Feodor F. Dragan, Arne Leitert

A graph is Helly if its disks satisfy the Helly property, i.e., every family of pairwise intersecting disks in G has a common intersection. It is known that for every graph G, ther…