Improving the crossing lemma by finding more crossings in sparse graphs (Q5361656): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/997817.997831 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2065507183 / rank | |||
Normal rank | |||
Latest revision as of 20:51, 19 March 2024
scientific article; zbMATH DE number 6783881
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improving the crossing lemma by finding more crossings in sparse graphs |
scientific article; zbMATH DE number 6783881 |
Statements
Improving the crossing lemma by finding more crossings in sparse graphs (English)
0 references
29 September 2017
0 references
