Transversals of longest cycles in partial k‐trees and chordal graphs
Juan Gutiérrez · Journal of Graph Theory · 2021
Abstract Let be the minimum cardinality of a set of vertices that intersects every longest cycle of a 2‐connected graph . We show that if is a partial ‐tree and that if is chordal, where is the cardinality of a maximum clique in . Those results imply that all longest cycles intersect in 2‐connected series‐parallel graphs and in 3‐trees.