Convexity in graphs

DOI10.4310/jdg/1214436096zbMath0493.05037WikidataQ115188456 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

zbMATH Keywords

shortest path; geodesics; convex hull; geodetic iteration number

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C38: Paths and cycles

05C99: Graph theory

Related Items

Extreme Geodesic Graphs, Unnamed Item, Convexity in oriented graphs, Graph theory (algorithmic, algebraic, and metric problems), Computing the shortest essential cycle, The convexity spectra of graphs, 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, An approach to building geometries based on points, lines and convexity, The geodetic number of an oriented graph, Partitioning a graph into convex sets, On two-path convexity in multipartite tournaments, The geodetic numbers of graphs and digraphs, On the geodetic number of a graph, The Forcing Convexity Number of a Graph