On finite convexity spaces induced by sets of paths in graphs

DOI10.1016/j.disc.2010.12.024zbMath1216.05062OpenAlexW2077321368MaRDI QIDQ533760

Dieter Rautenbach, Philipp Matthias Schäfer, Mitre C. Dourado

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

zbMATH Keywords

geodetic convexityconvexity spacemonophonic convexityall-path convexitytriangle-path convexity

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (4)

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 ⋮ Finding a Maximum-Weight Convex Set in a Chordal Graph

Cites Work

• Unnamed Item
• Complexity results related to monophonic convexity
• Axiomatic characterization of the interval function of a graph
• Triangle path transit functions, betweenness and pseudo-modular graphs
• On local convexity in graphs
• Convex sets in graphs. II: Minimal path convexity
• Disjoint paths in graphs
• 2-linked graphs
• On triangle path convexity in graphs
• The induced path convexity, betweenness, and svelte graphs
• Convexities related to path properties on graphs
• Solving the 2-disjoint paths problem in nearly linear time
• The All-Paths Transit Function of a Graph
• Convexity and HHD-Free Graphs

This page was built for publication: On finite convexity spaces induced by sets of paths in graphs