Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap

Noga Alon, Yair Caro, Raphael Yuster. Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap. Journal of Combinatorial Theory, Series A, 71(2):144-161, 1997. [doi]

@article{AlonCY97,
  title = {Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap},
  author = {Noga Alon and Yair Caro and Raphael Yuster},
  year = {1997},
  doi = {10.1006/jctb.1997.1768},
  url = {http://dx.doi.org/10.1006/jctb.1997.1768},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/AlonCY97},
  cites = {0},
  citedby = {0},
  journal = {Journal of Combinatorial Theory, Series A},
  volume = {71},
  number = {2},
  pages = {144-161},
}