Edge-disjoint trees containing some given vertices in a graph

Matthias Kriesell. Edge-disjoint trees containing some given vertices in a graph. Journal of Combinatorial Theory, Series A, 88(1):53-65, 2003. [doi]

@article{Kriesell03,
  title = {Edge-disjoint trees containing some given vertices in a graph},
  author = {Matthias Kriesell},
  year = {2003},
  doi = {10.1016/S0095-8956(02)00013-8},
  url = {http://dx.doi.org/10.1016/S0095-8956(02)00013-8},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Kriesell03},
  cites = {0},
  citedby = {0},
  journal = {Journal of Combinatorial Theory, Series A},
  volume = {88},
  number = {1},
  pages = {53-65},
}