Hyperbolic bridged graphs
A connected graph is bridged if it contains no isometric cycles of length more than 3, and it is 1-hyperbolic if for any 4 vertices the largest sum of diagonal distances is at most 1 higher than the second largest. It is shown that a graph satisfies both properties if and only if it does not contain any of 6 specified graphs as an isometric subgraph.
scientific article; zbMATH DE number 1884154