Arvind Gupta. A Constructive Proof that Trees Are Well-Quasi-Ordered Under Minors. In Anil Nerode, Michael A. Taitslin, editors, Logical Foundations of Computer Science - Tver 92, Second International Symposium, Tver, Russia, July 20-24, 1992, Proceedings. Volume 620 of Lecture Notes in Computer Science, pages 174-185, Springer, 1992.
@inproceedings{Gupta92:3,
title = {A Constructive Proof that Trees Are Well-Quasi-Ordered Under Minors},
author = {Arvind Gupta},
year = {1992},
researchr = {https://researchr.org/publication/Gupta92%3A3},
cites = {0},
citedby = {0},
pages = {174-185},
booktitle = {Logical Foundations of Computer Science - Tver 92, Second International Symposium, Tver, Russia, July 20-24, 1992, Proceedings},
editor = {Anil Nerode and Michael A. Taitslin},
volume = {620},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-55707-5},
}