11 citations · 12 across the 3 of their papers we have counts for
3 papers
Matroid basis graph: Counting Hamiltonian cycles
Cristina G. Fernandes, César Hernández-Vélez, José C. de Pina +1
We present exponential and super factorial lower bounds on the number of Hamiltonian cycles passing through any edge of the basis graphs of a graphic, generalized Catalan and unifo…
Spanning trees with nonseparating paths
Cristina G. Fernandes, César Hernández-Vélez, Orlando Lee +1
We consider questions related to the existence of spanning trees in graphs with the property that after the removal of any path in the tree the graph remains connected. We show tha…
A note on Johnson, Minkoff and Phillips' algorithm for the Prize-Collecting Steiner Tree Problem
Paulo Feofiloff, Cristina G. Fernandes, Carlos E. Ferreira +1
The primal-dual scheme has been used to provide approximation algorithms for many problems. Goemans and Williamson gave a (2-1/(n-1))-approximation for the Prize-Collecting Steiner…