Tolerant Radon partitions on the all-paths convexity in graphs

DOI10.1080/09728600.2023.2234010MaRDI QIDQ6651150

Could not fetch data.

Publication date: 10 December 2024

Published in: (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Paths and cycles (05C38) Distance in graphs (05C12)

Cites Work

• A generalisation of Tverberg's theorem
• Convex sets in a graph
• Convex sets in graphs. II: Minimal path convexity
• Caratheodory- and Helly-numbers of convex-product-structures
• On triangle path convexity in graphs
• Mengen konvexer Körper, die einen gemeinsamen Punkt enthalten.
• Convexities related to path properties on graphs
• Axiomatic convexity theory and relationships between the Carathéodory, Helly, and Radon numbers
• The All-Paths Transit Function of a Graph
• A Generalization of Radon's Theorem
• On Sets Projectively Equivalent to the Vertices of a Convex Polytope
• Algorithms for Radon partitions with tolerance
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Related Items (1)

All-path convexity: two characterizations, general position number, and one algorithm

This page was built for publication: Tolerant Radon partitions on the all-paths convexity in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6651150)