4 citations · 8 across the 8 of their papers we have counts for
1 paper · 1 filter
Daniel J. Harvey, Michael S. Payne
We consider the size of the smallest set of vertices required to intersect every longest path in a chordal graph. Such sets are known as longest path transversals. We show that if…