1 paper
Yun Shen, Lihua You, Minjie Zhang +1
A connected graph G is a cactus if any two of its cycles have at most one common vertex. Let ℓnm be the set of cacti on n vertices with matching number m. S.C. Li and…