Improving the crossing lemma by finding more crossings in sparse graphs (Q854708): Difference between revisions

@@ Property / author @@
-Gábor Tardos
@@ Property / author: Gábor Tardos / rank @@
-Normal rank
@@ Property / author @@
-Géza Tóth
@@ Property / author: Géza Tóth / rank @@
-Normal rank
@@ Property / author @@
+Gábor Tardos
@@ Property / author: Gábor Tardos / rank @@
+Normal rank
@@ Property / author @@
+Géza Tóth
@@ Property / author: Géza Tóth / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00454-006-1264-9
+Normal rank
@@ Property / OpenAlex ID @@
+W1993083969
@@ Property / OpenAlex ID: W1993083969 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q56454600
@@ Property / Wikidata QID: Q56454600 / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/dcg/PachRTT06
@@ Property / DBLP publication ID: journals/dcg/PachRTT06 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:854708