![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Leclerc B.
Publisher: Academic Press
ISSN: 0195-6698
Source: European Journal of Combinatorics, Vol.17, Iss.2, 1996-02, pp. : 255-264
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
NETWORK DESIGN FOR MINIMUM SPANNING TREES UNDER HAMMING DISTANCE
ANZIAM Journal, Vol. 58, Iss. 3-4, 2017-04 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
A Property on Edge-disjoint Spanning Trees
European Journal of Combinatorics, Vol. 17, Iss. 5, 1996-07 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On the Entropy of Spanning Trees on a Large Triangular Lattice
By Glasser M. Wu F.
The Ramanujan Journal, Vol. 10, Iss. 2, 2005-10 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Minimum degree and minimum number of edge-disjoint trees
Discrete Mathematics, Vol. 275, Iss. 1, 2004-01 ,pp. :