Transversals of Longest Paths

Márcia R. Cerioli, Cristina G. Fernandes, Renzo Gómez +2

Let $\lpt(G)$ be the minimum cardinality of a set of vertices that intersects all longest paths in a graph $G$. Let $\omega (G)$ be the size of a maximum clique in $G$, and $\tw(G)$ be t…