Convexity in graphs - MaRDI portal

Cited in

(57)

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

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)