Injective hulls of various graph classes
From MaRDI portal
Publication:2155861
DOI10.1007/s00373-022-02512-zzbMath1493.05083arXiv2007.14377OpenAlexW3045955368WikidataQ114229607 ScholiaQ114229607MaRDI QIDQ2155861
Heather M. Guarnera, Arne Leitert, Feodor F. Dragan
Publication date: 15 July 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.14377
distance-hereditary graphschordal graphsinjective hullpermutation graphs\(\delta\)-hyperbolicHelly graphssquare-chordal graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
- Hyperbolicity and chordality of a graph
- Clique graphs and Helly graphs
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
- Centers of triangulated graphs
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
- On the Helly property working as a compactness criterion on graphs
- Distance-hereditary graphs
- Pseudo-modular graphs
- Bridged graphs and geodesic convexity
- Dismantling absolute retracts of reflexive graphs
- Distances in cocomparability graphs and their powers
- Obstructions to a small hyperbolicity in Helly graphs
- The smallest graph variety containing all paths
- Powers of distance-hereditary graphs
- Tree-decompositions with bags of small diameter
- Eccentricity approximating trees
- Six theorems about injective metric spaces
- Helly-gap of a graph and vertex eccentricities
- INJECTIVE HULLS OF CERTAIN DISCRETE METRIC SPACES AND GROUPS
- Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
- Three Partition Refinement Algorithms
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- Dually Chordal Graphs
- Graph Classes: A Survey
- Asteroidal Triple-Free Graphs
- Core congestion is inherent in hyperbolic networks
- Generalized Powers of Graphs and Their Algorithmic Use
- A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs
- A story of diameter, radius, and (almost) Helly property
This page was built for publication: Injective hulls of various graph classes