On constructible graphs, locally Helly graphs, and convexity
From MaRDI portal
Publication:4422615
DOI10.1002/jgt.10120zbMath1023.05044MaRDI QIDQ4422615
Publication date: 20 August 2003
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.10120
Helly graph; infinite graph; Helly number; geodesic convexity; bridged graphs; constructible graph; dismantable graph
Related Items
A story of diameter, radius, and (almost) Helly property, Pursuit evasion on infinite graphs, Helly theorems for 3-Steiner and 3-monophonic convexity in graphs, Constructible graphs and pursuit, Beyond Helly graphs: the diameter problem on absolute retracts, Distance problems within Helly graphs and \(k\)-Helly graphs