Improving the crossing lemma by finding more crossings in sparse graphs (Q854708): Difference between revisions
From MaRDI portal
Removed claims |
Created claim: DBLP publication ID (P1635): journals/dcg/PachRTT06, #quickstatements; #temporary_batch_1731543907597 |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Gábor Tardos / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Géza Tóth / rank | |||
Normal rank | |||
| 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.1007/s00454-006-1264-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1993083969 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56454600 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/dcg/PachRTT06 / rank | |||
Normal rank | |||
Latest revision as of 01:30, 14 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improving the crossing lemma by finding more crossings in sparse graphs |
scientific article |
Statements
Improving the crossing lemma by finding more crossings in sparse graphs (English)
0 references
6 December 2006
0 references
