The following pages link to Convexity in graphs (Q1168332):
Displaying 50 items.
- On the Carathéodory number of interval and graph convexities (Q392186) (← links)
- The pre-hull number and lexicographic product (Q432717) (← links)
- Inapproximability results related to monophonic convexity (Q499364) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Computing the shortest essential cycle (Q603870) (← links)
- Convex \(p\)-partitions of bipartite graphs (Q897926) (← links)
- On the geodetic iteration number of distance-hereditary graphs (Q898096) (← links)
- The convexity spectra of graphs (Q944736) (← links)
- The hull and geodetic numbers of orientations of graphs (Q1025467) (← links)
- The forcing hull and forcing geodetic numbers of graphs (Q1028447) (← links)
- The hull number of a graph (Q1070243) (← links)
- On local convexity in graphs (Q1089354) (← links)
- A survey of the theory of hypercube graphs (Q1102985) (← links)
- The geodetic number of a graph (Q1310238) (← links)
- Geodetic spectra of graphs. (Q1427436) (← links)
- A lower bound for the convexity number of some graphs (Q1428997) (← links)
- Optimal gray-code labeling and recognition algorithms for hypercubes (Q1602516) (← links)
- The forcing total restrained geodetic number and the total restrained geodetic number of a graph: realizability and complexity (Q1680878) (← links)
- The maximum time of 2-neighbor bootstrap percolation: complexity results (Q1686067) (← links)
- Total restrained geodetic number of graphs (Q1696108) (← links)
- On the contour of bipartite graphs (Q1752491) (← links)
- An approach to building geometries based on points, lines and convexity (Q1836150) (← links)
- On the convexity number of graphs (Q1926045) (← links)
- The geodetic number of an oriented graph (Q1971800) (← links)
- Characterizations of \(L\)-convex spaces via domain theory (Q2036808) (← links)
- A general framework for path convexities (Q2156285) (← links)
- On the geodetic iteration number of a graph in which geodesic and monophonic convexities are equivalent (Q2192072) (← links)
- A centrality notion for graphs based on Tukey depth (Q2244178) (← links)
- Partitioning a graph into convex sets (Q2275456) (← links)
- Characterizations of convex spaces and anti-matroids via derived operators (Q2278365) (← links)
- On the Carathéodory and exchange numbers of geodetic convexity in graphs (Q2283030) (← links)
- Lattice-equivalence of convex spaces (Q2311873) (← links)
- The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects (Q2346581) (← links)
- The restrained geodetic number of a graph (Q2350702) (← links)
- On two-path convexity in multipartite tournaments (Q2426441) (← links)
- On the contour of graphs (Q2446313) (← links)
- The geodetic numbers of graphs and digraphs (Q2461517) (← links)
- Algorithms for convex hull finding in undirected graphical models (Q2698143) (← links)
- On the geodetic number of a graph (Q2782725) (← links)
- On the Convexity of Paths of Length Two in Undirected Graphs (Q2839205) (← links)
- (Q2857327) (← links)
- The Forcing Convexity Number of a Graph (Q3151365) (← links)
- Extreme Geodesic Graphs (Q4800005) (← links)
- Outer-weakly convex domination number of graphs (Q4957532) (← links)
- (Q4963116) (← links)
- FORCING SUBSETS FOR SOME TYPES OF CONVEX SETS IN A GRAPH (Q4973382) (← links)
- (Q5062364) (← links)
- Outer-convex domination in graphs (Q5216447) (← links)
- (Q5708560) (← links)
- Convexity in oriented graphs (Q5957301) (← links)
