Paul Erdös, Michael E. Saks, Vera T. Sós. Maximum induced trees in graphs. Journal of Combinatorial Theory, Series A, 41(1):61-79, 1986. [doi]
@article{ErdosSS86,
title = {Maximum induced trees in graphs},
author = {Paul Erdös and Michael E. Saks and Vera T. Sós},
year = {1986},
doi = {10.1016/0095-8956(86)90028-6},
url = {http://dx.doi.org/10.1016/0095-8956(86)90028-6},
tags = {graph-rewriting, e-science, rewriting},
researchr = {https://researchr.org/publication/ErdosSS86},
cites = {0},
citedby = {0},
journal = {Journal of Combinatorial Theory, Series A},
volume = {41},
number = {1},
pages = {61-79},
}