1 paper
G. A. T. F da Costa, M. Policarpo
We compute the number of equivalence classes of nonperiodic covering cycles of given length in a non oriented connected graph. A covering cycle is a closed path that traverses each…