Dismantling absolute retracts of reflexive graphs

From MaRDI portal
Publication:1121291

DOI10.1016/S0195-6698(89)80053-8zbMath0674.05065MaRDI QIDQ1121291

Hans-Jürgen Bandelt, Erwin Pesch

Publication date: 1989

Published in: European Journal of Combinatorics (Search for Journal in Brave)




Related Items

Pseudo-modular graphsMini-workshop: Nonpositively curved complexes. Abstracts from the mini-workshop held February 7--13, 2021 (online meeting)Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphsAbsolute retracts of split graphsThe algebra of metric betweenness. I: Subdirect representation and retractionFaster recognition of clique-Helly and hereditary clique-Helly graphsInjective hulls of various graph classesOn neighborhood-Helly graphs3-colouring for dually chordal graphs and generalisationsA Radon theorem for Helly graphsHelly-gap of a graph and vertex eccentricitiesA note on \(r\)-dominating cliquesGraphs with a regular endomorphism monoidBeyond Helly graphs: the diameter problem on absolute retractsA story of diameter, radius, and (almost) Helly propertyDistance problems within Helly graphs and \(k\)-Helly graphsFirst-order logic axiomatization of metric graph theoryGraphs of some CAT(0) complexesEfficient characterizations of \(n\)-chromatic absolute retractsAbsolute reflexive retracts and absolute bipartite retractsBiclique-Helly graphsProducts of absolute retractsThe Helly property and satisfiability of Boolean formulas defined on set familiesAbsolute retracts and varieties generated by chordal graphsOn the extension of vertex maps to graph homomorphismsWeakly Modular Graphs and Nonpositive CurvatureKirszbraun-type theorems for graphsDecomposition and \(l_1\)-embedding of weakly median graphsA polynomial algorithm for the strong Helly propertyClique graphs and Helly graphs



Cites Work