On the public citation graph

Hyperbolicity and Chordality of a Graph

0 signed · 137 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/jgt.20275openalex-snapshot
Scaled Gromov hyperbolic graphs
inferredcites →https://doi.org/10.1002/jgt.3190170210openalex-snapshot
On the chordality of a graph
inferredcites →https://doi.org/10.1006/aama.1996.0503openalex-snapshot
Trees, Taxonomy, and Strongly Compatible Multi-state Characters
inferredcites →https://doi.org/10.1006/eujc.1996.0015openalex-snapshot
T-theory: An Overview
inferredcites →https://doi.org/10.1006/eujc.2002.0591openalex-snapshot
Hyperbolic Bridged Graphs
inferredcites →https://doi.org/10.1006/inco.1997.2697openalex-snapshot
All Structured Programs Have Small Tree Width and Good Register Allocation
inferredcites →https://doi.org/10.1006/jagm.1996.0854openalex-snapshot
Domino Treewidth
inferredcites →https://doi.org/10.1006/jcss.2001.1809openalex-snapshot
Hypertree Decompositions and Tractable Queries
inferredcites →https://doi.org/10.1007/11564751_15openalex-snapshot
Beyond Hypertree Width: Decomposition Methods Without Decompositions
inferredcites →https://doi.org/10.1007/11602613_106openalex-snapshot
Distance Labeling in Hyperbolic Graphs
inferredcites →https://doi.org/10.1007/3-540-45477-2_6openalex-snapshot
On the Tree-Degree of Graphs
inferredcites →https://doi.org/10.1007/3-540-59071-4_39openalex-snapshot
On domination elimination orderings and domination graphs
inferredcites →https://doi.org/10.1007/978-3-540-74208-1_5openalex-snapshot
Packing and Covering δ-Hyperbolic Spaces by Balls
inferredcites →https://doi.org/10.1007/978-3-540-87779-0_11openalex-snapshot
Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics
inferredcites →https://doi.org/10.1007/978-3-642-00234-2openalex-snapshot
Encyclopedia of Distances
inferredcites →https://doi.org/10.1007/978-3-642-03816-7_25openalex-snapshot
How to Use Spanning Trees to Navigate in Graphs
inferredcites →https://doi.org/10.1007/978-3-662-12494-9openalex-snapshot
Metric Spaces of Non-Positive Curvature
inferredcites →https://doi.org/10.1007/978-3-662-44342-2openalex-snapshot
Encyclopedia of Distances
inferredcites →https://doi.org/10.1007/bf01068561openalex-snapshot
Conditions for invariance of set diameters under d-convexification in a graph
inferredcites →https://doi.org/10.1007/bf02020961openalex-snapshot
Transitiv orientierbare Graphen
inferredcites →https://doi.org/10.1007/s00026-001-8007-7openalex-snapshot
On the Hyperbolicity of Chordal Graphs
inferredcites →https://doi.org/10.1007/s00026-007-0302-5openalex-snapshot
Some Uses of the Farris Transform in Mathematics and Phylogenetics—A Review
inferredcites →https://doi.org/10.1007/s00453-010-9478-xopenalex-snapshot
Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs
inferredcites →https://doi.org/10.1007/s004930100012openalex-snapshot
On the Sparsity Order of a Graph and Its Deficiency in Chordality
inferredcites →https://doi.org/10.1016/0001-8708(84)90029-xopenalex-snapshot
Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
inferredcites →https://doi.org/10.1016/0095-8956(79)90069-8openalex-snapshot
On metric properties of certain clique graphs
inferredcites →https://doi.org/10.1016/0095-8956(84)90013-3openalex-snapshot
Graph minors. III. Planar tree-width
inferredcites →https://doi.org/10.1016/0095-8956(85)90050-4openalex-snapshot
Weakly triangulated graphs
inferredcites →https://doi.org/10.1016/0095-8956(86)90043-2openalex-snapshot
Distance-hereditary graphs
inferredcites →https://doi.org/10.1016/0095-8956(88)90093-7openalex-snapshot
On bridged graphs and cop-win graphs
inferredcites →https://doi.org/10.1016/0196-6774(86)90023-4openalex-snapshot
Graph minors. II. Algorithmic aspects of tree-width
inferredcites →https://doi.org/10.1016/0196-6774(91)90006-kopenalex-snapshot
Easy problems for tree-decomposable graphs
inferredcites →https://doi.org/10.1016/j.dam.2003.01.003openalex-snapshot
Δ additive and Δ ultra-additive maps, Gromov's trees, and the Farris transform
inferredcites →https://doi.org/10.1016/j.disc.2005.12.060openalex-snapshot
Tree-decompositions with bags of small diameter
inferredcites →https://doi.org/10.1016/j.disc.2008.04.059openalex-snapshot
Asymptotic connectivity of infinite graphs
inferredcites →https://doi.org/10.1016/j.disc.2009.01.009openalex-snapshot
Tree-length equals branch-length
inferredcites →https://doi.org/10.1016/j.ejc.2008.11.010openalex-snapshot
On tree-partition-width
inferredcites →https://doi.org/10.1016/j.endm.2008.06.046openalex-snapshot
Notes on diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs
inferredcites →https://doi.org/10.1016/j.exmath.2005.01.010openalex-snapshot
Gromov hyperbolic spaces
inferredcites →https://doi.org/10.1016/j.jcss.2006.08.002openalex-snapshot
Online promise problems with online width metrics
inferredcites →https://doi.org/10.1016/j.jcss.2007.08.001openalex-snapshot
A unified theory of structural tractability for constraint satisfaction problems
inferredcites →https://doi.org/10.1016/j.tcs.2008.02.038openalex-snapshot
Digraph measures: Kelly decompositions, games, and orderings
inferredcites →https://doi.org/10.1016/s0012-365x(01)00115-7openalex-snapshot
Graph homotopy and Graham homotopy
inferredcites →https://doi.org/10.1016/s0020-0190(01)00222-8openalex-snapshot
Algorithms for maximum weight induced paths
inferredcites →https://doi.org/10.1016/s0166-218x(00)00274-2openalex-snapshot
Domination graphs: examples and counterexamples
inferredcites →https://doi.org/10.1016/s0166-218x(97)00031-0openalex-snapshot
Treewidth for graphs with small chordality
inferredcites →https://doi.org/10.1016/s0166-218x(98)00128-0openalex-snapshot
Retractions of finite distance functions onto tree metrics
inferredcites →https://doi.org/10.1016/s0304-0208(08)73032-9openalex-snapshot
Types of Cycles in Hypergraphs
inferredcites →https://doi.org/10.1016/s0304-3975(96)00177-6openalex-snapshot
Fugitive-search games on graphs and related parameters
inferredcites →https://doi.org/10.1080/00029890.1970.11992422openalex-snapshot
What is the Maximum Length of a d -Dimensional Snake?
inferredcites →https://doi.org/10.1090/conm/453/08795openalex-snapshot
Metric graph theory and geometry: a survey
inferredcites →https://doi.org/10.1093/comjnl/bxm052openalex-snapshot
Width Parameters Beyond Tree-width and their Applications
inferredcites →https://doi.org/10.1109/18.910572openalex-snapshot
Factor graphs and the sum-product algorithm
inferredcites →https://doi.org/10.1109/cdc.2007.4434878openalex-snapshot
Effective resistance of Gromov-hyperbolic graphs: Application to asymptotic sensor network problems
inferredcites →https://doi.org/10.1109/infcom.2007.221openalex-snapshot
Geographic Routing Using Hyperbolic Space
inferredcites →https://doi.org/10.1109/sfcs.2003.1238226openalex-snapshot
Bounded geometries, fractals, and low-distortion embeddings
inferredcites →https://doi.org/10.1109/tnet.2007.899021openalex-snapshot
Hyperbolic Embedding of Internet Graph for Distance Estimation and Overlay Construction
inferredcites →https://doi.org/10.11234/gi1990.14.376openalex-snapshot
Graph Complexity of Chemical Compounds in Biological Pathways
inferredcites →https://doi.org/10.1137/1.9780898719796openalex-snapshot
Graph Classes: A Survey
inferredcites →https://doi.org/10.1137/s0097539793255709openalex-snapshot
The Linkage of a Graph
inferredcites →https://doi.org/10.1137/s0895480100380902openalex-snapshot
1-Hyperbolic Graphs
inferredcites →https://doi.org/10.1137/s0895480103427138openalex-snapshot
On the Number of Minimum Cuts in a Graph
inferredcites →https://doi.org/10.1145/1281100.1281110openalex-snapshot
Reconstructing approximate tree metrics
inferredcites →https://doi.org/10.1145/2402.322390openalex-snapshot
Degrees of acyclicity for hypergraphs and relational database schemes
inferredcites →https://doi.org/10.2307/2412452openalex-snapshot
A Numerical Approach to Phylogenetic Systematics
inferredcites →https://doi.org/10.4153/cjm-1970-125-1openalex-snapshot
k -Degenerate Graphs
inferredcites →https://doi.org/10.46298/dmtcs.343openalex-snapshot
Graphs of low chordality
inferredcites →https://doi.org/10.5555/1283383.1283452openalex-snapshot
Digraph measures: Kelly decompositions, games, and orderings

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/mma.9074openalex-snapshot
Geometric and topological properties of the complementary prism networks
inferred← citeshttps://doi.org/10.1002/net.21631openalex-snapshot
Metric tree‐like structures in real‐world networks: an empirical study
inferred← citeshttps://doi.org/10.1007/978-3-030-05414-4_38openalex-snapshot
Social Media Group Structure and Its Goals: Building an Order
inferred← citeshttps://doi.org/10.1007/978-3-030-83508-8_22openalex-snapshot
Fast Deterministic Algorithms for Computing All Eccentricities in (Hyperbolic) Helly Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-93409-5_17openalex-snapshot
Fellow Travelers Phenomenon Present in Real-World Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-16112-9_7openalex-snapshot
Core-Periphery Models for Graphs Based on their δ-Hyperbolicity: An Example Using Biological Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_54openalex-snapshot
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_19openalex-snapshot
On Computing the Hyperbolicity of Real-World Graphs
inferred← citeshttps://doi.org/10.1007/s00010-024-01076-yopenalex-snapshot
Gromov hyperbolicity of Johnson and Kneser graphs
inferred← citeshttps://doi.org/10.1007/s00025-023-02095-yopenalex-snapshot
Parabolicity on Graphs
inferred← citeshttps://doi.org/10.1007/s00373-014-1459-4openalex-snapshot
Planarity and Hyperbolicity in Graphs
inferred← citeshttps://doi.org/10.1007/s00373-022-02512-zopenalex-snapshot
Injective Hulls of Various Graph Classes
inferred← citeshttps://doi.org/10.1007/s00453-014-9871-yopenalex-snapshot
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth
inferred← citeshttps://doi.org/10.1007/s00453-024-01223-6openalex-snapshot
$$\alpha _i$$-Metric Graphs: Radius, Diameter and all Eccentricities
inferred← citeshttps://doi.org/10.1007/s10114-013-2370-2openalex-snapshot
Gromov hyperbolicity of periodic planar graphs
inferred← citeshttps://doi.org/10.1007/s10114-013-2467-7openalex-snapshot
Characterization of Gromov hyperbolic short graphs
inferred← citeshttps://doi.org/10.1007/s10114-017-6324-yopenalex-snapshot
On a classical theorem on the diameter and minimum degree of a graph
inferred← citeshttps://doi.org/10.1007/s12044-013-0149-0openalex-snapshot
Hyperbolicity in median graphs
inferred← citeshttps://doi.org/10.1007/s12044-018-0451-yopenalex-snapshot
Gromov hyperbolicity in lexicographic product graphs
inferred← citeshttps://doi.org/10.1007/s13398-015-0235-5openalex-snapshot
Bounds on Gromov hyperbolicity constant
inferred← citeshttps://doi.org/10.1007/s13398-021-01096-2openalex-snapshot
A note on isoperimetric inequalities of Gromov hyperbolic manifolds and graphs
inferred← citeshttps://doi.org/10.1007/s40840-015-0250-xopenalex-snapshot
Gromov Hyperbolicity of Periodic Graphs
inferred← citeshttps://doi.org/10.1007/s41980-018-0032-yopenalex-snapshot
On the Hyperbolicity Constant in Graph Minors
inferred← citeshttps://doi.org/10.1007/s41980-018-0055-4openalex-snapshot
Gromov Hyperbolicity in the Cartesian Sum of Graphs
inferred← citeshttps://doi.org/10.1016/j.camwa.2011.10.041openalex-snapshot
Computing the hyperbolicity constant
inferred← citeshttps://doi.org/10.1016/j.dam.2016.06.017openalex-snapshot
On the hyperbolicity of bipartite graphs and intersection graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.01.011openalex-snapshot
On the hyperbolicity constant of circular-arc graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.06.041openalex-snapshot
Several extremal problems on graphs involving the circumference, girth, and hyperbolicity constant
inferred← citeshttps://doi.org/10.1016/j.dam.2026.02.006openalex-snapshot
Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2013.04.009openalex-snapshot
Gromov hyperbolic graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2016.06.013openalex-snapshot
Small values of the hyperbolicity constant in graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2018.10.017openalex-snapshot
Obstructions to a small hyperbolicity in Helly graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114743openalex-snapshot
Isometric path complexity of graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2014.08.019openalex-snapshot
Bounds on the Hyperbolicity Constant
inferred← citeshttps://doi.org/10.1016/j.endm.2014.08.035openalex-snapshot
Graphs with small hyperbolicity constant
inferred← citeshttps://doi.org/10.1016/j.endm.2017.06.051openalex-snapshot
A simple approach for lower-bounding the distortion in any Hyperbolic embedding
inferred← citeshttps://doi.org/10.1016/j.entcs.2016.03.005openalex-snapshot
Into the Square: On the Complexity of Some Quadratic-time Solvable Problems
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103606openalex-snapshot
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.05.025openalex-snapshot
Data center interconnection networks are not hyperbolic
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.06.001openalex-snapshot
Applying clique-decomposition for computing Gromov hyperbolicity
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.03.022openalex-snapshot
Helly-gap of a graph and vertex eccentricities
inferred← citeshttps://doi.org/10.1038/s41598-019-48568-5openalex-snapshot
Functional Geometry of Human Connectomes
inferred← citeshttps://doi.org/10.1051/ro/2025124openalex-snapshot
On λ -Forman-Ricci curvature of networks
inferred← citeshttps://doi.org/10.1080/00207160.2013.866232openalex-snapshot
Computing the hyperbolicity constant of a cubic graph
inferred← citeshttps://doi.org/10.1080/15427951.2016.1182952openalex-snapshot
Tree decompositions and social graphs
inferred← citeshttps://doi.org/10.1103/physreve.102.032307openalex-snapshot
Large-scale influence of defect bonds in geometrically constrained self-assembly
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00101openalex-snapshot
Explicit near-fully X-Ramanujan graphs
inferred← citeshttps://doi.org/10.1137/140954787openalex-snapshot
Recognition of $C_4$-Free and 1/2-Hyperbolic Graphs
inferred← citeshttps://doi.org/10.1142/s021919971750050xopenalex-snapshot
Cheeger isoperimetric constant of Gromov hyperbolic manifolds and graphs
inferred← citeshttps://doi.org/10.1145/2780652openalex-snapshot
On Computing the Gromov Hyperbolicity
inferred← citeshttps://doi.org/10.1177/1748301816665519openalex-snapshot
Core–periphery models for graphs based on their δ -hyperbolicity: An example using biological networks
inferred← citeshttps://doi.org/10.1515/math-2017-0061openalex-snapshot
The hyperbolicity constant of infinite circulant graphs
inferred← citeshttps://doi.org/10.2197/ipsjjip.29.725openalex-snapshot
Dynamic Hyperbolic Embeddings with Graph-Centralized Regularization for Recommender Systems
inferred← citeshttps://doi.org/10.22541/au.166148821.16285794/v1openalex-snapshot
CMMSE Geometric and topological properties of the complementary prism networks
inferred← citeshttps://doi.org/10.23638/dmtcs-21-3-10openalex-snapshot
Slimness of graphs
inferred← citeshttps://doi.org/10.2478/s11533-012-0036-4openalex-snapshot
Gromov hyperbolic cubic graphs
inferred← citeshttps://doi.org/10.2478/s11533-013-0286-9openalex-snapshot
Gromov hyperbolicity of planar graphs
inferred← citeshttps://doi.org/10.3390/dynamics2040026openalex-snapshot
Cyclical Trends of Network Load Fluctuations in Traffic Jamming
inferred← citeshttps://doi.org/10.3390/sym10070279openalex-snapshot
Hyperbolicity of Direct Products of Graphs
inferred← citeshttps://doi.org/10.3390/sym12010105openalex-snapshot
Gromov Hyperbolicity in Directed Graphs
inferred← citeshttps://doi.org/10.3390/sym9080131openalex-snapshot
Gromov Hyperbolicity in Mycielskian Graphs
inferred← citeshttps://doi.org/10.3390/sym9100199openalex-snapshot
Generalized Chordality, Vertex Separators and Hyperbolicity on Graphs
inferred← citeshttps://doi.org/10.3390/sym9110255openalex-snapshot
Mathematical Properties on the Hyperbolicity of Interval Graphs
inferred← citeshttps://doi.org/10.37236/697openalex-snapshot
On the Hyperbolicity Constant of Line Graphs
inferred← citeshttps://doi.org/10.3934/math.20231474openalex-snapshot
On the hyperbolicity of Delaunay triangulations
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2023.32openalex-snapshot
Isometric Path Complexity of Graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.12544openalex-snapshot
Leanness Computation: Small Values and Special Graph Classes
inferred← citeshttps://doi.org/10.48550/arxiv.1708.06153openalex-snapshot
Generalized chordality, vertex separators and hyperbolicity on graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1904.03399openalex-snapshot
Functional Geometry of Human Connectome and Robustness of Gender Differences
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.