Arthur Farley
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Combinatorics×1Discrete Math×1
Frequent co-authors
Research Timeline
2026
Totally Disjoint Diametral Paths
This paper studies the problem of finding totally disjoint diametral paths in simple connected graphs and provides algorithms for certain classes of graphs.
Highlighted terms show continued research focus across papers