On finite convexity spaces induced by sets of paths in graphs
From MaRDI portal
Publication:533760
DOI10.1016/J.DISC.2010.12.024zbMATH Open1216.05062OpenAlexW2077321368MaRDI QIDQ533760FDOQ533760
Authors: Mitre C. Dourado, Dieter Rautenbach, Philipp M. Schäfer 
Publication date: 6 May 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.12.024
Recommendations
Cites Work
- On local convexity in graphs
- Disjoint paths in graphs
- 2-linked graphs
- Triangle path transit functions, betweenness and pseudo-modular graphs
- Convex sets in graphs. II: Minimal path convexity
- On triangle path convexity in graphs
- Convexities related to path properties on graphs
- Complexity results related to monophonic convexity
- Convexity and HHD-Free Graphs
- The All-Paths Transit Function of a Graph
- Axiomatic characterization of the interval function of a graph
- The induced path convexity, betweenness, and svelte graphs
- Solving the 2-disjoint paths problem in nearly linear time
- Title not available (Why is that?)
Cited In (13)
- Finding a Maximum-Weight Convex Set in a Chordal Graph
- 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
- Title not available (Why is that?)
- Generalizing the Krein-Milman property in graph convexity spaces: a short survey
- Title not available (Why is that?)
- Decomposable convexities in graphs and hypergraphs
- 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)
