Strong immersion is a well-quasi-ordering for semicomplete digraphs

Florian Barbero, Christophe Paul, Michal Pilipczuk. Strong immersion is a well-quasi-ordering for semicomplete digraphs. Journal of Graph Theory, 90(4):484-496, 2019. [doi]

@article{BarberoPP19,
  title = {Strong immersion is a well-quasi-ordering for semicomplete digraphs},
  author = {Florian Barbero and Christophe Paul and Michal Pilipczuk},
  year = {2019},
  doi = {10.1002/jgt.22408},
  url = {https://doi.org/10.1002/jgt.22408},
  researchr = {https://researchr.org/publication/BarberoPP19},
  cites = {0},
  citedby = {0},
  journal = {Journal of Graph Theory},
  volume = {90},
  number = {4},
  pages = {484-496},
}