TY - JOUR
AU - Fernandes, Cristina G.
AU - Gutiérrez, Juan
PY - 2017
TI - Hitting all longest cycles in a graph
JF - Anais do Encontro de Teoria da Computação (ETC); 2017: Anais do II Encontro de Teoria da Computação
DO - 10.5753/etc.2017.3185
KW -
N2 - 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.
UR - https://sol.sbc.org.br/index.php/etc/article/view/3185