1 paper
Wensheng Sun, Yujun Yang, Shou-Jun Xu
A graph G is called equiarboreal if the number of spanning trees containing a given edge in G is independent of the choice of edge. In [Combinatorica 1(2) (1981) 163--167], God…