Hyperbolic bridged graphs
type: Item
instance of: scholarly article
title: Hyperbolic bridged graphs
zbMATH Open document ID: 1027.05035
author: Jack H. Koolen
author: Vincent Moulton
published in: European Journal of Combinatorics
publication date: 2003-03-18T00:00:00Z
review text: 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.
reviewed by: Frank Plastria
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1884154
zbMATH Keywords: hyperbolic graphs
zbMATH Keywords: bridged graph
zbMATH Keywords: thin graph
MaRDI profile type: Publication
full work available at URL: eujc.2002.0591
OpenAlex ID: W2012993200
cites work: Powers of distance-hereditary graphs
cites work: Distance-hereditary graphs
cites work: Geodetic graphs of diameter two
cites work: Graph Classes: A Survey
cites work: On the hyperbolicity of chordal graphs
cites work: Trees, taxonomy, and strongly compatible multi-state characters
cites work: \(T\)-theory: An overview
cites work: On local convexity in graphs
cites work: Q4321412
cites work: Topics in Intersection Graph Theory
cites work: Retractions of finite distance functions onto tree metrics
cites work: Strongly geodesically automatic groups are hyperbolic
cites work: Q3342619
DOI: 10.1006/EUJC.2002.0591
description: scientific article; zbMATH DE number 1884154