Skip to Main content Skip to Navigation
Journal articles

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

Florian Barbero 1 Christophe Paul 1 Michał Pilipczuk 2
1 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : We prove that the strong immersion order is a well‐quasi‐ordering on the class of semicomplete digraphs, thereby strengthening a result of Chudnovsky and Seymour (2011, J. Comb. Theory, Series B, 101, 47–53) that this holds for the class of tournaments.
Document type :
Journal articles
Complete list of metadata
Contributor : Christophe Paul Connect in order to contact the contributor
Submitted on : Monday, November 12, 2018 - 10:01:58 AM
Last modification on : Monday, October 11, 2021 - 1:24:08 PM

Links full text




Florian Barbero, Christophe Paul, Michał Pilipczuk. Strong immersion is a well-quasi-ordering for semicomplete digraphs. Journal of Graph Theory, Wiley, 2019, 90, pp.484-496. ⟨10.1002/jgt.22408⟩. ⟨lirmm-01918986⟩



Record views