Trees with three leaves are (\(n+1\))-unavoidable (Q1827852): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| 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 09:23, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Trees with three leaves are (\(n+1\))-unavoidable |
scientific article |
Statements
Trees with three leaves are (\(n+1\))-unavoidable (English)
0 references
6 August 2004
0 references
Tournament
0 references
Unavoidable
0 references
Tree
0 references
0 references
