Chordality properties and hyperbolicity on graphs
The electronic journal of combinatorics, Tome 23 (2016) no. 3
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Let $G$ be a graph with the usual shortest-path metric. A graph is $\delta$-hyperbolic if for every geodesic triangle $T$, any side of $T$ is contained in a $\delta$-neighborhood of the union of the other two sides. A graph is chordal if every induced cycle has at most three edges. In this paper we study the relation between the hyperbolicity of the graph and some chordality properties which are natural generalizations of being chordal. We find chordality properties that are weaker and stronger than being $\delta$-hyperbolic. Moreover, we obtain a characterization of being hyperbolic on terms of a chordality property on the triangles.
DOI : 10.37236/5315
Classification : 05C63, 05C10, 05C12
Mots-clés : infinite graph, geodesic, Gromov hyperbolic, chordal

Álvaro Martínez-Pérez  1

1 Universidad de Castilla-La Mancha
@article{10_37236_5315,
     author = {\'Alvaro Mart{\'\i}nez-P\'erez},
     title = {Chordality properties and hyperbolicity on graphs},
     journal = {The electronic journal of combinatorics},
     year = {2016},
     volume = {23},
     number = {3},
     doi = {10.37236/5315},
     zbl = {1351.05158},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/5315/}
}
TY  - JOUR
AU  - Álvaro Martínez-Pérez
TI  - Chordality properties and hyperbolicity on graphs
JO  - The electronic journal of combinatorics
PY  - 2016
VL  - 23
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.37236/5315/
DO  - 10.37236/5315
ID  - 10_37236_5315
ER  - 
%0 Journal Article
%A Álvaro Martínez-Pérez
%T Chordality properties and hyperbolicity on graphs
%J The electronic journal of combinatorics
%D 2016
%V 23
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/5315/
%R 10.37236/5315
%F 10_37236_5315
Álvaro Martínez-Pérez. Chordality properties and hyperbolicity on graphs. The electronic journal of combinatorics, Tome 23 (2016) no. 3. doi: 10.37236/5315

Cité par Sources :