Conditions for invariance of set diameters under d-convexification in a graph
From MaRDI portal
Publication:3677791
DOI10.1007/BF01068561zbMath0564.05037OpenAlexW2125359873MaRDI QIDQ3677791
Publication date: 1983
Published in: Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01068561
Related Items
Fixed finite subgraph theorems in infinite weakly modular graphs, Separation of two convex sets in convexity structures, On local convexity in graphs, Induced path transit function, monotone and Peano axioms, The algebra of metric betweenness. I: Subdirect representation and retraction, Eccentricity Approximating Trees, Bridged graphs and geodesic convexity, On bridged graphs and cop-win graphs, On diameters and radii of bridged graphs, A Helly theorem in weakly modular space, A note on \(r\)-dominating cliques, Eccentricity approximating trees, Bucolic complexes, Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs, Normal subgroups of SimpHAtic groups, Graphs with \(G^p\)-connected medians, Quadric complexes, First-order logic axiomatization of metric graph theory, Hyperbolic isometries and boundaries of systolic complexes, On the contour of graphs, Graphs of some CAT(0) complexes, On the contour of bipartite graphs, Retracts of Products of Chordal Graphs, Partitioning a graph into convex sets, On covering bridged plane triangulations with balls, Weakly Modular Graphs and Nonpositive Curvature, Consequences of an algorithm for bridged graphs, Dismantlability of weakly systolic complexes and applications, Decomposition and \(l_1\)-embedding of weakly median graphs, Distances in benzenoid systems: Further developments, Shortcut graphs and groups, Distance labeling schemes for \(K_4\)-free bridged graphs
Cites Work
