2 papers
math.CO2020
On Tuza's conjecture for triangulations and graphs with small treewidth
Fábio Botler, Cristina G. Fernandes, Juan Gutiérrez
Tuza (1981) conjectured that the size of a minimum set of edges that intersects every triangle of a graph is at most twice the size of a maximum set of edge-disjo…
cs.DM2017
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 . Let be the size of a maximum clique in , and $\tw(G)$ be t…