Convexity in graphs
From MaRDI portal
Cited in
(67)- The hull and geodetic numbers of orientations of graphs
- The forcing hull and forcing geodetic numbers of graphs
- The hull number of a graph
- On local convexity in graphs
- A survey of the theory of hypercube graphs
- The geodetic number of a graph
- Geodetic spectra of graphs.
- A lower bound for the convexity number of some graphs
- Optimal gray-code labeling and recognition algorithms for hypercubes
- The forcing total restrained geodetic number and the total restrained geodetic number of a graph: realizability and complexity
- The maximum time of 2-neighbor bootstrap percolation: complexity results
- Total restrained geodetic number of graphs
- On the contour of bipartite graphs
- An approach to building geometries based on points, lines and convexity
- On the convexity number of graphs
- The geodetic number of an oriented graph
- Characterizations of \(L\)-convex spaces via domain theory
- On the geodetic iteration number of a graph in which geodesic and monophonic convexities are equivalent
- A centrality notion for graphs based on Tukey depth
- Partitioning a graph into convex sets
- Characterizations of convex spaces and anti-matroids via derived operators
- On the Carathéodory and exchange numbers of geodetic convexity in graphs
- Lattice-equivalence of convex spaces
- The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects
- The restrained geodetic number of a graph
- On two-path convexity in multipartite tournaments
- On the contour of graphs
- The geodetic numbers of graphs and digraphs
- Algorithms for convex hull finding in undirected graphical models
- On the geodetic number of a graph
- On the convexity of paths of length two in undirected graphs
- On the Carathéodory number for the convexity of paths of order three
- The Forcing Convexity Number of a Graph
- On the Carathéodory number of interval and graph convexities
- The pre-hull number and lexicographic product
- Extreme Geodesic Graphs
- Outer-weakly convex domination number of graphs
- scientific article; zbMATH DE number 6973779 (Why is no real title available?)
- Forcing subsets for some types of convex sets in a graph
- Inapproximability results related to monophonic convexity
- On characterizations of graphs having large geodetic numbers
- Outer-convex domination in graphs
- scientific article; zbMATH DE number 2230268 (Why is no real title available?)
- Graph theory (algorithmic, algebraic, and metric problems)
- Convexity in oriented graphs
- Computing the shortest essential cycle
- On the hull number on cycle convexity of graphs
- Maximal closed set and half-space separations in finite closure systems
- Bounds and algorithms for geodetic hulls
- Target set selection with maximum activation time
- THE FORCING CONVEX DOMINATION NUMBER OF A GRAPH
- scientific article; zbMATH DE number 7690927 (Why is no real title available?)
- On convex subgraph polynomials and some of its important values
- Core potentials: the consensus segmentation conjecture
- Geodetic number of cyclic graphs
- Bounds on the P₃-Carathéodory number
- The closed geodetic game: algorithms and strategies
- Improved bounds for geodetic hulls
- Totally bounded ultrametric spaces generated by labeled rays
- The convex set forming game
- The iteration time and the general position number in graph convexities
- Matching (multi)cut: algorithms, complexity, and enumeration
- The closed geodetic game: algorithms and strategies
- On the rank and the general position number in cycle convexity
- Convex \(p\)-partitions of bipartite graphs
- On the geodetic iteration number of distance-hereditary graphs
- The convexity spectra of graphs
This page was built for publication: Convexity in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1168332)