On constructible graphs, locally Helly graphs, and convexity

DOI10.1002/jgt.10120zbMath1023.05044OpenAlexW4239092426MaRDI QIDQ4422615

Norbert Polat

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

zbMATH Keywords

Helly graphinfinite graphHelly numbergeodesic convexitybridged graphsconstructible graphdismantable graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (6)

Pursuit evasion on infinite graphs ⋮ Constructible graphs and pursuit ⋮ Beyond Helly graphs: the diameter problem on absolute retracts ⋮ A story of diameter, radius, and (almost) Helly property ⋮ Distance problems within Helly graphs and \(k\)-Helly graphs ⋮ Helly theorems for 3-Steiner and 3-monophonic convexity in graphs

This page was built for publication: On constructible graphs, locally Helly graphs, and convexity