On local convexity in graphs
From MaRDI portal
Publication:1089354
DOI10.1016/0012-365X(87)90099-9zbMath0619.05032MaRDI QIDQ1089354
Robert E. Jamison, Martin Farber
Publication date: 1987
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
The contour of a bridged graph is geodetic, On geodetic sets formed by boundary vertices, Fixed finite subgraph theorems in infinite weakly modular graphs, Separation of two convex sets in convexity structures, On the geodetic iteration number of the contour of a graph, The maximum infection time of the \(P_3\) convexity in graphs with bounded maximum degree, Induced path transit function, monotone and Peano axioms, The algebra of metric betweenness. I: Subdirect representation and retraction, Eccentricity Approximating Trees, On the null-homotopy of bridged graphs, Complexity of determining the maximum infection time in the geodetic convexity, Bridged graphs and geodesic convexity, A general framework for path convexities, On bridged graphs and cop-win graphs, Unnamed Item, On diameters and radii of bridged graphs, A Helly theorem in weakly modular space, A note on \(r\)-dominating cliques, Eccentricity approximating trees, On the Carathéodory number of interval and graph convexities, Bucolic complexes, Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs, Normal subgroups of SimpHAtic groups, Graphs with \(G^p\)-connected medians, The maximum infection time in the geodesic and monophonic convexities, Graphs with convex balls, \textsc{Minimum Surgical Probing} with convexity constraints, Domination and convexity problems in the target set selection model, First-order logic axiomatization of metric graph theory, On a local 3-Steiner convexity, The Carathéodory number of the \(P_3\) convexity of chordal graphs, Graphs of some CAT(0) complexes, Metric characterization of parity graphs, Inapproximability results for graph convexity parameters, On finite convexity spaces induced by sets of paths in graphs, Retracts of Products of Chordal Graphs, Toll convexity, Absolute retracts and varieties generated by chordal graphs, Unnamed Item, On geodesic structures of weakly median graphs. I. Decomposition and octahedral graphs, On the parameterized complexity of the geodesic hull number, On the Steiner, geodetic and hull numbers of graphs, NP-completeness results for edge modification problems, Partitioning a graph into convex sets, Complexity results related to monophonic convexity, Characterizations of convex spaces and anti-matroids via derived operators, Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs, Characterizations of \(L\)-convex spaces via domain theory, On covering bridged plane triangulations with balls, Wait-free approximate agreement on graphs, Weakly Modular Graphs and Nonpositive Curvature, Wait-free approximate agreement on graphs, Local Steiner convexity, Selfishness of convex bodies and discrete point sets, Lattice-equivalence of convex spaces, Unnamed Item, Convex and quasiconvex functions in metric graphs, 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, Finding a Maximum-Weight Convex Set in a Chordal Graph, Distance labeling schemes for \(K_4\)-free bridged graphs, Hyperbolic bridged graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On rigid circuit graphs
- A convexity problem in 3-polytopal graphs
- A convex characterization of the graphs of the dodecahedron and icosahedron
- A Helly theorem for convexity in graphs
- On powers and centers of chordal graphs
- Ensemble convexes dans les graphes. I: Théoremes de Helly et de Radon pour graphes et surfaces
- On the null-homotopy of bridged graphs
- Bridged graphs and geodesic convexity
- Convex sets in graphs. II: Minimal path convexity
- Partition numbers for trees and ordered sets
- Convexity in graphs
- Parallel concepts in graph theory
- Geodesic subgraphs
- Conditions for invariance of set diameters under d-convexification in a graph
- Convexity in Graphs and Hypergraphs
