Convexity in graphs

From MaRDI portal
Publication:1168332

DOI10.4310/jdg/1214436096zbMath0493.05037OpenAlexW1583458608WikidataQ115188456 ScholiaQ115188456MaRDI QIDQ1168332

Frank Harary, Juhani Nieminen

Publication date: 1981

Published in: Journal of Differential Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4310/jdg/1214436096



Related Items

Outer-weakly convex domination number of graphs, On local convexity in graphs, Extreme Geodesic Graphs, A survey of the theory of hypercube graphs, A general framework for path convexities, Unnamed Item, Computing the shortest essential cycle, On the convexity number of graphs, The forcing total restrained geodetic number and the total restrained geodetic number of a graph: realizability and complexity, On the Carathéodory number of interval and graph convexities, The maximum time of 2-neighbor bootstrap percolation: complexity results, On the hull number on cycle convexity of graphs, Maximal closed set and half-space separations in finite closure systems, On the geodetic iteration number of a graph in which geodesic and monophonic convexities are equivalent, Bounds and algorithms for geodetic hulls, Target set selection with maximum activation time, Convex \(p\)-partitions of bipartite graphs, On the geodetic iteration number of distance-hereditary graphs, On two-path convexity in multipartite tournaments, THE FORCING CONVEX DOMINATION NUMBER OF A GRAPH, Total restrained geodetic number of graphs, The pre-hull number and lexicographic product, Algorithms for convex hull finding in undirected graphical models, Unnamed Item, On the contour of graphs, Geodetic spectra of graphs., A lower bound for the convexity number of some graphs, The geodetic number of an oriented graph, The geodetic numbers of graphs and digraphs, Inapproximability results related to monophonic convexity, The convexity spectra of graphs, A centrality notion for graphs based on Tukey depth, On the contour of bipartite graphs, Unnamed Item, Unnamed Item, On the geodetic number of a graph, Partitioning a graph into convex sets, Graph theory (algorithmic, algebraic, and metric problems), Characterizations of convex spaces and anti-matroids via derived operators, Convexity in oriented graphs, On the Carathéodory and exchange numbers of geodetic convexity in graphs, Characterizations of \(L\)-convex spaces via domain theory, Outer-convex domination in graphs, FORCING SUBSETS FOR SOME TYPES OF CONVEX SETS IN A GRAPH, The hull and geodetic numbers of orientations of graphs, Lattice-equivalence of convex spaces, The forcing hull and forcing geodetic numbers of graphs, Unnamed Item, On the Convexity of Paths of Length Two in Undirected Graphs, An approach to building geometries based on points, lines and convexity, The geodetic number of a graph, The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects, Optimal gray-code labeling and recognition algorithms for hypercubes, The restrained geodetic number of a graph, The hull number of a graph, The Forcing Convexity Number of a Graph