Maximum induced trees in graphs. Erdös, P., Saks, M. E., & Sós, V. T. J. Comb. Theory B, 41(1):61-79, 1986.
Maximum induced trees in graphs. [link]Link  Maximum induced trees in graphs. [link]Paper  bibtex   
@article{journals/jct/ErdosSS86,
  added-at = {2024-06-07T00:00:00.000+0200},
  author = {Erdös, Paul and Saks, Michael E. and Sós, Vera T.},
  biburl = {https://www.bibsonomy.org/bibtex/2125cd24e2e39316cda692bc968da717a/dblp},
  ee = {https://www.wikidata.org/entity/Q56388813},
  interhash = {416927632ba84d0129fc14eee70385c3},
  intrahash = {125cd24e2e39316cda692bc968da717a},
  journal = {J. Comb. Theory B},
  keywords = {dblp},
  number = 1,
  pages = {61-79},
  timestamp = {2024-06-10T07:06:45.000+0200},
  title = {Maximum induced trees in graphs.},
  url = {http://dblp.uni-trier.de/db/journals/jct/jctb41.html#ErdosSS86},
  volume = 41,
  year = 1986
}

Downloads: 0