%A Fernandes, Cristina G.
%A Gutiérrez, Juan
%D 2017
%T Hitting all longest cycles in a graph
%K
%X Let lct(G) be the minimum size of a set of vertices that contains at least one vertex in every longest cycle of a graph G. We show that lct(G) = 1 if G is a 3-tree, and that lct(G) ≤ 2 if G is a 2-connected partial 3-tree.
%U https://sol.sbc.org.br/index.php/etc/article/view/3185
%J Anais do Encontro de Teoria da Computação (ETC)
%0 Journal Article
%R 10.5753/etc.2017.3185
%P 33-36%@ 2595-6116
%8 2017-07-02