Trees with three leaves are (\(n+1\))-unavoidable (Q1827852): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On unavoidability of trees with \(k\) leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On avoidable and unavoidable claws / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3950574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths and Cycles in Tournaments / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0166-218x(03)00366-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976444262 / rank
 
Normal rank

Latest revision as of 08:23, 30 July 2024

scientific article
Language Label Description Also known as
English
Trees with three leaves are (\(n+1\))-unavoidable
scientific article

    Statements

    Identifiers