On finite convexity spaces induced by sets of paths in graphs
From MaRDI portal
Publication:533760
Recommendations
Cites work
- scientific article; zbMATH DE number 3068278 (Why is no real title available?)
- 2-linked graphs
- Axiomatic characterization of the interval function of a graph
- Complexity results related to monophonic convexity
- Convex sets in graphs. II: Minimal path convexity
- Convexities related to path properties on graphs
- Convexity and HHD-Free Graphs
- Disjoint paths in graphs
- On local convexity in graphs
- On triangle path convexity in graphs
- Solving the 2-disjoint paths problem in nearly linear time
- The All-Paths Transit Function of a Graph
- The induced path convexity, betweenness, and svelte graphs
- Triangle path transit functions, betweenness and pseudo-modular graphs
Cited in
(16)- All-path convexity: two characterizations, general position number, and one algorithm
- On the Carathéodory number of interval and graph convexities
- An upper bound on the \(P_3\)-Radon number
- On the contour of bipartite graphs
- Path-closed sets
- Convex sets in graphs. II: Minimal path convexity
- Computing simple-path convex hulls in hypergraphs
- Convexities related to path properties on graphs
- Decomposability of abstract and path-induced convexities in hypergraphs
- scientific article; zbMATH DE number 3881391 (Why is no real title available?)
- Finding a maximum-weight convex set in a chordal graph
- Generalizing the Krein-Milman property in graph convexity spaces: a short survey
- scientific article; zbMATH DE number 3962623 (Why is no real title available?)
- Decomposable convexities in graphs and hypergraphs
- All-path convexity: combinatorial and complexity aspects.
- Graphs with intrinsic s3 convexities
This page was built for publication: On finite convexity spaces induced by sets of paths in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q533760)