Dismantling absolute retracts of reflexive graphs
From MaRDI portal
DOI10.1016/S0195-6698(89)80053-8zbMATH Open0674.05065MaRDI QIDQ1121291FDOQ1121291
Authors: Hans-Jürgen Bandelt, Erwin Pesch 
Publication date: 1989
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Recommendations
Cites Work
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
- Vertex-to-vertex pursuit in a graph
- Six theorems about injective metric spaces
- Title not available (Why is that?)
- Extension of uniformly continuous transformations and hyperconvex metric spaces
- Title not available (Why is that?)
- Absolute retracts of bipartite graphs
- Absolute Retracts and Varieties of Reflexive Graphs
- The smallest graph variety containing all paths
- A characterization of absolute retracts of n-chromatic graphs
- Minimal extensions of graphs to absolute retracts
Cited In (39)
- A note on \(r\)-dominating cliques
- Kirszbraun-type theorems for graphs
- On retracts, absolute retracts, and foldings in cographs
- Absolute Retracts and Varieties of Reflexive Graphs
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
- Injective hulls of various graph classes
- Faster recognition of clique-Helly and hereditary clique-Helly graphs
- The Helly property and satisfiability of Boolean formulas defined on set families
- Absolute retracts and varieties generated by chordal graphs
- First-order Definable Retraction Problems for Posets and Reflexive Graphs
- 3-colouring for dually chordal graphs and generalisations
- Pseudo-modular graphs
- Biclique-Helly graphs
- A story of diameter, radius, and (almost) Helly property
- Decomposition and \(l_1\)-embedding of weakly median graphs
- The algebra of metric betweenness. I: Subdirect representation and retraction
- Graphs of some CAT(0) complexes
- Clique graphs and Helly graphs
- A characterization of absolute retracts of n-chromatic graphs
- A Radon theorem for Helly graphs
- Products of absolute retracts
- First-order logic axiomatization of metric graph theory
- Weakly Modular Graphs and Nonpositive Curvature
- Helly-gap of a graph and vertex eccentricities
- On the extension of vertex maps to graph homomorphisms
- On neighborhood-Helly graphs
- Beyond Helly graphs: the diameter problem on absolute retracts
- Mini-workshop: Nonpositively curved complexes. Abstracts from the mini-workshop held February 7--13, 2021 (online meeting)
- Helly groups
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
- Absolute reflexive retracts and absolute bipartite retracts
- Distance problems within Helly graphs and \(k\)-Helly graphs
- On retracts, absolute retracts, and folds in cographs
- Graphs with a regular endomorphism monoid
- Efficient characterizations of \(n\)-chromatic absolute retracts
- Absolute retracts of split graphs
- A polynomial algorithm for the strong Helly property
This page was built for publication: Dismantling absolute retracts of reflexive graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121291)
