Tolerant Radon partitions on the all-paths convexity in graphs
AbstractIn a graph G, the all-paths transit function A(u, v), consists of the set of all vertices in the graph G which lies in some path connecting u and v. Convexity obtained by the all-paths transit function is called all-paths convexity. A partition of a set P of vertices of a graph G into two di...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2024-01-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | https://www.tandfonline.com/doi/10.1080/09728600.2023.2234010 |