Mathematical properties on the hyperbolicity of interval graphs
Summary: Gromov hyperbolicity is an interesting geometric property, and so it is natural to study it in the context of geometric graphs. In particular, we are interested in interval and indifference graphs, which are important classes of intersection and Euclidean graphs, respectively. Interval graphs (with a very weak hypothesis) and indifference graphs are hyperbolic. In this paper, we give a sharp bound for their hyperbolicity constants. The main result in this paper is the study of the hyperbolicity constant of every interval graph with edges of length 1. Moreover, we obtain sharp estimates for the hyperbolicity constant of the complement of any interval graph with edges of length 1.
- On the hyperbolicity constant in graphs
- Chordality properties and hyperbolicity on graphs
- scientific article; zbMATH DE number 4053674
- scientific article; zbMATH DE number 4117862
- Hyperbolicity and parameters of graphs.
- Hyperbolicity and complement of graphs
- scientific article; zbMATH DE number 4095511
- Hyperbolicity and chordality of a graph
- On the hyperbolicity of bipartite graphs and intersection graphs
- Hypergraphs and intervals. II.
- A Bound for the Diameter of Random Hyperbolic Graphs
- A Characterization of Comparability Graphs and of Interval Graphs
- A linear time recognition algorithm for proper interval graphs
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs
- Characterizing hyperbolic spaces and real trees
- Chordality properties and hyperbolicity on graphs
- Computing the Gromov hyperbolicity of a discrete metric space
- Computing the hyperbolicity constant
- Cop and robber game and hyperbolicity
- Counting subgraphs in hyperbolic graphs with symmetry
- Discrete groups. Transl. from the Japanese by Ken'ichi Ohshika
- Extremal interval graphs
- Finding Hamiltonian circuits in proper interval graphs
- Generalized chordality, vertex separators and hyperbolicity on graphs
- Graphs and Gromov hyperbolicity of non-constant negatively curved surfaces
- Gromov hyperbolicity and convex tessellation graph
- Gromov hyperbolicity through decomposition of metric spaces
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3877239 (Why is no real title available?)
- scientific article; zbMATH DE number 4031953 (Why is no real title available?)
- Hyperbolic bridged graphs
- Hyperbolicity and chordality of a graph
- Hyperbolicity and parameters of graphs.
- Lack of Gromov-hyperbolicity in small-world networks
- Mathematical properties of the hyperbolicity of circulant networks
- Non-hyperbolicity of random graphs with given expected degrees
- Notes on diameters, centers, and approximating trees of -hyperbolic geodesic spaces and graphs
- On computing the Gromov hyperbolicity
- On the hyperbolicity of chordal graphs
- On the hyperbolicity of edge-chordal and path-chordal graphs
- On the hyperbolicity of random graphs
- Scaled Gromov hyperbolic graphs
- Small values of the hyperbolicity constant in graphs
- Spanning connectedness and Hamiltonian thickness of graphs and interval graphs
- Squarepants in a tree: sum of subtree clustering and hyperbolic pants decomposition
- Traffic congestion in expanders and (p, )-hyperbolic spaces
- Upper bound on scaled Gromov-hyperbolic \(\delta \)
This page was built for publication: Mathematical properties on the hyperbolicity of interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2333446)
