Packing spanning trees and spanning 2-connected k-edge-connected essentially (2k-1)-edge-connected subgraphs

Xiaofeng Gu. Packing spanning trees and spanning 2-connected k-edge-connected essentially (2k-1)-edge-connected subgraphs. J. Comb. Optim., 33(3):924-933, 2017. [doi]

@article{Gu17,
  title = {Packing spanning trees and spanning 2-connected k-edge-connected essentially (2k-1)-edge-connected subgraphs},
  author = {Xiaofeng Gu},
  year = {2017},
  doi = {10.1007/s10878-016-0014-z},
  url = {http://dx.doi.org/10.1007/s10878-016-0014-z},
  researchr = {https://researchr.org/publication/Gu17},
  cites = {0},
  citedby = {0},
  journal = {J. Comb. Optim.},
  volume = {33},
  number = {3},
  pages = {924-933},
}