Artykuł w czasopiśmie
Brak miniatury
Licencja
ClosedAccessDostęp zamknięty
 

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

Uproszczony widok
dc.abstract.enAbstract 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.
dc.affiliationUniwersytet Warszawski
dc.contributor.authorPilipczuk, Michał
dc.contributor.authorBarbero, Florian
dc.contributor.authorPaul, Christophe
dc.date.accessioned2024-01-26T08:20:51Z
dc.date.available2024-01-26T08:20:51Z
dc.date.issued2018
dc.description.financeNie dotyczy
dc.description.number4
dc.description.volume90
dc.identifier.doi10.1002/JGT.22408
dc.identifier.issn0364-9024
dc.identifier.urihttps://repozytorium.uw.edu.pl//handle/item/120855
dc.languageeng
dc.pbn.affiliationcomputer and information sciences
dc.relation.ispartofJournal of Graph Theory
dc.relation.pages484-496
dc.rightsClosedAccess
dc.sciencecloudnosend
dc.subject.enimmersion order semicomplete digraphs well-quasi-ordering
dc.titleStrong immersion is a well-quasi-ordering for semicomplete digraphs
dc.typeJournalArticle
dspace.entity.typePublication