Transversals of Longest Cycles in Partial $k$-Trees and Chordal Graphs

Juan Gutiérrez

Let $lct(G)$ be the minimum cardinality of a set of vertices that intersects every longest cycle of a 2-connected graph $G$. We show that $lct(G)\le k-1$ if $G$ is a partial $k$-t…