English

Obstructions to a small hyperbolicity in Helly graphs

Data Structures and Algorithms 2019-07-15 v2 Discrete Mathematics Combinatorics

Abstract

It is known that for every graph GG there exists the smallest Helly graph H(G)\cal H(G) into which GG isometrically embeds (H(G)\cal H(G) is called the injective hull of GG) such that the hyperbolicity of H(G)\cal H(G) is equal to the hyperbolicity of GG. Motivated by this, we investigate structural properties of Helly graphs that govern their hyperbolicity and identify three isometric subgraphs of the King-grid as structural obstructions to a small hyperbolicity in Helly graphs.

Cite

@article{arxiv.1709.02837,
  title  = {Obstructions to a small hyperbolicity in Helly graphs},
  author = {Feodor F. Dragan and Heather M. Guarnera},
  journal= {arXiv preprint arXiv:1709.02837},
  year   = {2019}
}

Comments

18 pages, 16 figures

R2 v1 2026-06-22T21:37:38.710Z