Geodesic Convexity in Graphs
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Extremal problems in graph theory (05C35) Connectivity (05C40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)
Recommendations
- Geodesic geometry on graphs
- Geodetic convexity and Kneser graphs
- Geodesic convexity in discrete spaces
- scientific article; zbMATH DE number 437485
- Geodetic convexity parameters for graphs with few short induced paths
- scientific article; zbMATH DE number 1064241
- scientific article; zbMATH DE number 3893234
- scientific article; zbMATH DE number 1743966
- Geodesic graphs with homogeneity conditions
- scientific article; zbMATH DE number 5531985
Cited in
(only showing first 100 items - show all)- On the geodesic pre-hull number of a graph
- Bridged graphs and geodesic convexity
- Geodesic convexity in discrete spaces
- Strong geodetic number of complete bipartite graphs and of graphs with specified diameter
- Toll number of the strong product of graphs
- Steiner convex sets and Cartesian product
- On the contour of bipartite graphs
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs
- Strong geodetic number of graphs and connectivity
- Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes
- Toll number of the Cartesian and the lexicographic product of graphs
- Boundary-type sets in maximal outerplanar graphs
- On the \(P_3\)-hull number of Kneser graphs
- Convex and quasiconvex functions in metric graphs
- Convex geometries over induced paths with bounded length
- An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs
- The geodesic classification problem on graphs
- Well-partitioned chordal graphs
- Computing the hull number in toll convexity
- A note on the convexity number of the complementary prisms of trees
- On the -interval and the -convexity numbers of graphs and graph products
- On the toll number of a graph
- On the P₃-hull number of Hamming graphs
- A note on the geodetic number and the Steiner number of AT-free graphs
- Toll convexity
- Strong geodetic problem in networks
- On the Carathéodory and exchange numbers of geodetic convexity in graphs
- Strong geodetic cores and Cartesian product graphs
- Convex median and anti-median at prescribed distance
- Inapproximability results and bounds for the Helly and Radon numbers of a graph
- Geodeticity of the contour of chordal graphs
- Three problems on well-partitioned chordal graphs
- Geodetic convexity and Kneser graphs
- The geometry of convex affine maximal graphs
- Complexity aspects of the triangle path convexity
- Helly and exchange numbers of geodesic and Steiner convexities in lexicographic product of graphs
- Near-linear-time algorithm for the geodetic Radon number of grids
- scientific article; zbMATH DE number 437485 (Why is no real title available?)
- Geodeticity of the contour of chordal bipartite graphs
- scientific article; zbMATH DE number 3880749 (Why is no real title available?)
- Continuous average Straightness in spatial graphs
- A note on path domination
- Steiner trees and convex geometries
- scientific article; zbMATH DE number 5531985 (Why is no real title available?)
- scientific article; zbMATH DE number 7528 (Why is no real title available?)
- scientific article; zbMATH DE number 108143 (Why is no real title available?)
- scientific article; zbMATH DE number 1064241 (Why is no real title available?)
- Strong geodetic problem on Cartesian products of graphs
- On the vertex monophonic, vertex geodetic and vertex Steiner numbers of graphs
- STRONG DOUBLY GEODETIC PROBLEM ON GRAPHS
- Tight paths in convex geometric hypergraphs
- Graphs with 4-Steiner convex balls
- scientific article; zbMATH DE number 3893234 (Why is no real title available?)
- scientific article; zbMATH DE number 6729997 (Why is no real title available?)
- A new notion of convexity in digraphs with an application to Bayesian networks
- Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs
- Computational and structural aspects of the geodetic and the hull numbers of shadow graphs
- Computational and structural aspects of the geodetic and the hull numbers of shadow graphs
- On the monophonic rank of a graph
- scientific article; zbMATH DE number 7739488 (Why is no real title available?)
- Algorithms and complexity for geodetic sets on partial grids
- scientific article; zbMATH DE number 7765365 (Why is no real title available?)
- On the hull number on cycle convexity of graphs
- A unifying view on recombination spaces and abstract convex evolutionary search
- Maximal closed set and half-space separations in finite closure systems
- Bounds and algorithms for geodetic hulls
- The boundary of a graph and its isoperimetric inequality
- Computing the hull and interval numbers in the weakly toll convexity
- \textsc{Minimum Surgical Probing} with convexity constraints
- Distance-based covering problems for graphs of given cyclomatic number
- Integer programming models and polyhedral study for the geodesic classification problem on graphs
- On monophonic position sets in graphs
- Convex sets in lexicographic products of graphs
- Weakly toll convexity and proper interval graphs
- Characterizations of graph classes via convex geometries: a survey
- Quasiconvex functions on regular trees
- Induced geodetic sequence of a graph
- Geodetic number of cyclic graphs
- Restrained geodetic domination polynomial
- Some graph parameters of Indu-Bala product of graphs
- Carathéodory number and exchange number in -convexity
- Distance critical graphs
- On the strong geodeticity in the corona type product of graphs
- Totally bounded ultrametric spaces generated by labeled rays
- Helly number, Radon number and rank in -convexity on graphs
- Distance-based (and path-based) covering problems for graphs of given cyclomatic number
- On walk domination: weakly toll domination, l₂ and l₃ domination
- Characterization of the geodesic distance on infinite graphs
- Impartial geodetic building games on graphs
- \textsc{Minimum Surgical Probing} with convexity constraints
- Strong geodetic problem in grid-like architectures
- Half-space separation in monophonic convexity
- Algorithms and complexity for geodetic sets on interval and chordal graphs
- Algorithms and hardness for geodetic set on tree-like digraphs
- Testing whether a subgraph is convex or isometric
- Geodesic structures in Chebyshev and Manhattan metric spaces
- Monophonic number of Kneser graphs and strongly 2-monophonic graphs
- Learning weakly convex sets in metric spaces
- Geodetic set on graphs of constant pathwidth and feedback vertex set number
- On the rank and the general position number in cycle convexity
This page was built for publication: Geodesic Convexity in Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849538)
