64 citations · 89 across the 4 of their papers we have counts for
Showing 2004Show all
2 papers · 1 filter
cond-mat.stat-mech2004★ 2 cited
Minimal vertex covers of random trees
Stephane Coulomb
We study minimal vertex covers of trees. Contrarily to the number of minimal vertex covers of the tree , is a self-averaging quantity. We show that,…
math.CO2004
On vertex covers, matchings and random trees
Stephane Coulomb, Michel Bauer
We study minimal vertex covers and maximal matchings on trees. We pay special attention to the corresponding backbones i.e. these vertices that are occupied and those that are empt…