![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Kor Liah
Publisher: Springer Publishing Company
ISSN: 1432-4350
Source: Theory of Computing Systems, Vol.53, Iss.2, 2013-08, pp. : 318-340
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)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Minimum Spanning Trees and Types of Dissimilarities
By Leclerc B.
European Journal of Combinatorics, Vol. 17, Iss. 2, 1996-02 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Bounds on minimum semidefinite rank of graphs
Linear and Multilinear Algebra, Vol. 63, Iss. 4, 2015-04 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Factorizations of some weighted spanning tree enumerators
Journal of Combinatorial Theory, Series A, Vol. 104, Iss. 2, 2003-11 ,pp. :