Get access

Balancing two spanning trees



It is proved that if a finite graph G has a factorization into two spanning trees then it admits one such that all leaves in either factor have degree at most 8 in G. © 2011 Wiley Periodicals, Inc. NETWORKS, Vol. 57(4), 351-353 2011

Get access to the full text of this article