A distance approximating trees

Bálint, Vojtech

doi:10.1016/j.dam.2007.11.012

Search citation statements

Order By: Relevance

Paper Sections

Select...

Approximating Trees Slimness and Thinness1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2009

2017

Publication Types

Select...

Other1

Article1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first approach is to look at distance approximating trees. A tree T is a distance t-approximating tree of a graph G provided [6,14,23,40]. It is well-known that a graph with a good distance approximating tree will have low hyperbolicity, which is briefly mentioned in [26, p. 3] and [27, p. 64] and is in the same spirit of a general result on hyperbolic geodesic metric spaces [16, p. 402, Theorem 1.9].…”

Section: Approximating Trees Slimness and Thinnessmentioning

confidence: 96%

Chordality and hyperbolicity of a graph

Wu,

Zhang

2009

Preprint

View full text Add to dashboard Cite

Let G be a connected graph with the usual shortest-path metric d. The graph G is δ-hyperbolic provided for any vertices x, y, u, v in it, the two larger of the three sums d(u, v)+ d(x, y), d(u, x)+ d(v, y) and d(u, y) + d(v, x) differ by at most 2δ. The graph G is k-chordal provided it has no induced cycle of length greater than k. Brinkmann, Koolen and Moulton find that every 3-chordal graph is 1-hyperbolic and is not 1 2 -hyperbolic if and only if it contains one of two special graphs as an isometric subgraph. For every k ≥ 4, we show that a k-chordal graph must be2 -hyperbolic and there does exist a k-chordal graph which is not2 -hyperbolic. Moreover, we prove that a 5-chordal graph is 1 2 -hyperbolic if and only if it does not contain any of a list of six special graphs (See Fig. 3) as an isometric subgraph.

show abstract

Section: Approximating Trees Slimness and Thinnessmentioning

confidence: 96%