Packing spanning trees and spanning 2-connected k-edge-connected essentially $$(2k-1)$$ ( 2 k - 1 ) -edge-connected subgraphs
Crossref DOI link: https://doi.org/10.1007/s10878-016-0014-z
Published Online: 2016-04-08
Published Print: 2017-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Gu, Xiaofeng
Text and Data Mining valid from 2016-04-08