On triangle path convexity in graphs
From MaRDI portal
Publication:1304810
DOI10.1016/S0012-365X(98)00394-XzbMath0929.05046MaRDI QIDQ1304810
Publication date: 11 January 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (41)
On geodetic sets formed by boundary vertices ⋮ Complexity aspects of the triangle path convexity ⋮ \(P_3\)-hull number of graphs with diameter two ⋮ On the geodetic hull number of \(P_{k}\)-free graphs ⋮ On the \(P_3\)-hull number of some products of graphs ⋮ Intervals and convex sets in strong product of graphs ⋮ Geodetic Convexity Parameters for Graphs with Few Short Induced Paths ⋮ A general framework for path convexities ⋮ A note on path domination ⋮ On the \(\Delta \)-interval and the \(\Delta \)-convexity numbers of graphs and graph products ⋮ Some Steiner concepts on lexicographic products of graphs ⋮ \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers ⋮ Axiomatic characterization of the interval function of a block graph ⋮ On the Carathéodory number of interval and graph convexities ⋮ Equivalence between hypergraph convexities ⋮ On two-path convexity in multipartite tournaments ⋮ Computing simple-path convex hulls in hypergraphs ⋮ Domination and convexity problems in the target set selection model ⋮ The convexity of induced paths of order three and applications: complexity aspects ⋮ The pre-hull number and lexicographic product ⋮ Revisiting Decomposition by Clique Separators ⋮ Decomposable convexities in graphs and hypergraphs ⋮ An upper bound on the \(P_3\)-Radon number ⋮ On the contour of graphs ⋮ The Carathéodory number of the \(P_3\) convexity of chordal graphs ⋮ Computing the \(\mathcal{P}_3\)-hull number of a graph, a polyhedral approach ⋮ Graphs with few \(P_4\)'s under the convexity of paths of order three ⋮ On finite convexity spaces induced by sets of paths in graphs ⋮ Toll convexity ⋮ Unnamed Item ⋮ Convexities related to path properties on graphs ⋮ Partitioning a graph into convex sets ⋮ Geodetic convexity parameters for \((q, q - 4)\)-graphs ⋮ On the Carathéodory and exchange numbers of geodetic convexity in graphs ⋮ Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs ⋮ Decomposability of abstract and path-induced convexities in hypergraphs ⋮ Triangle path transit functions, betweenness and pseudo-modular graphs ⋮ Selfishness of convex bodies and discrete point sets ⋮ On the Convexity of Paths of Length Two in Undirected Graphs ⋮ Complexity aspects of \(\ell\)-chord convexities ⋮ Canonical and monophonic convexities in hypergraphs
This page was built for publication: On triangle path convexity in graphs
