Neil Robertson, Paul D. Seymour. Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering. Journal of Combinatorial Theory, Series A, 89(1):77-108, 2003. [doi]
@article{RobertsonS03b,
title = {Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering},
author = {Neil Robertson and Paul D. Seymour},
year = {2003},
doi = {10.1016/S0095-8956(03)00067-4},
url = {http://dx.doi.org/10.1016/S0095-8956(03)00067-4},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/RobertsonS03b},
cites = {0},
citedby = {0},
journal = {Journal of Combinatorial Theory, Series A},
volume = {89},
number = {1},
pages = {77-108},
}