Beyond Helly graphs: the diameter problem on absolute retracts

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Absolute reflexive retracts and absolute bipartite retracts
Into the square: on the complexity of some quadratic-time solvable problems
Multivariate analysis of orthogonal range searching and graph distances
Clique graphs and Helly graphs
Covering planar graphs with a fixed number of balls
Absolute retracts and varieties generated by chordal graphs
Characterizations of strongly chordal graphs
Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
A characterization of absolute retracts of n-chromatic graphs
Dismantling absolute retracts of reflexive graphs
A Radon theorem for Helly graphs
Computation of the center and diameter of outerplanar graphs
Classes of bipartite graphs related to chordal graphs
Efficient characterizations of \(n\)-chromatic absolute retracts
Almost diameter of a house-hole-free graph in linear time via LexBFS
Absolute retracts of split graphs
\(r\)-dominating cliques in graphs with hypertree structure
On constructible graphs, infinite bridged graphs and weakly cop-win graphs
Obstructions to a small hyperbolicity in Helly graphs
On retracts, absolute retracts, and foldings in cographs
Absolute retracts of bipartite graphs
Domination in quadrangle-free Helly graphs
A characterisation of rigid circuit graphs
Algorithmic graph theory and perfect graphs
Fast diameter computation within split graphs
Faster recognition of clique-Helly and hereditary clique-Helly graphs
VC-dimension and Erdős-Pósa property
Six theorems about injective metric spaces
The intersection graphs of subtrees in trees are exactly the chordal graphs
Absolute planar retracts and the four colour conjecture
Helly-gap of a graph and vertex eccentricities
Computing Giant Graph Diameters
Graph Theory
On the Desirability of Acyclic Database Schemes
Absolute Retracts and Varieties of Reflexive Graphs
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
Retracts of hypercubes
A simple linear-time algorithm for computing the center of an interval graph
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
Minimal extensions of graphs to absolute retracts
A survey of various modifications of the notions of absolute retracts and absolute neighborhood retracts
Perfect Elimination and Chordal Bipartite Graphs
Dually Chordal Graphs
On constructible graphs, locally Helly graphs, and convexity
Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs
Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs
Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs
Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension
Collective dynamics of ‘small-world’ networks
Fast approximation algorithms for the diameter and radius of sparse graphs
Products of absolute retracts
Hardness and structural results for half-squares of restricted tree convex bipartite graphs
Convexity and fixed-point properties in Helly graphs
Diameter determination on restricted graph families

This page was built for publication: Beyond Helly graphs: the diameter problem on absolute retracts