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 there exists the smallest Helly graph into which isometrically embeds ( is called the injective hull of ) such that the hyperbolicity of is equal to the hyperbolicity of . 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