An upper bound for the rectilinear crossing number of the complete graph (Q2545098): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0095-8956(71)90045-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2069888750 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5523467 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Number of Crossings in a Complete Graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a problem of P. Erdös / rank | |||
Normal rank | |||
Latest revision as of 02:00, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound for the rectilinear crossing number of the complete graph |
scientific article |
Statements
An upper bound for the rectilinear crossing number of the complete graph (English)
0 references
1971
0 references
