On the \(k\)-planar local crossing number (Q1727762): Difference between revisions

@@ Property / author @@
-Thao T. Do
@@ Property / author: Thao T. Do / rank @@
-Normal rank
@@ Property / author @@
+Thao T. Do
@@ Property / author: Thao T. Do / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2962838183
@@ Property / OpenAlex ID: W2962838183 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.02117
@@ Property / arXiv ID: 1804.02117 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
+Normal rank
@@ Property / cites work @@
+Q5782525
@@ Property / cites work: Q5782525 / rank @@
+Normal rank
@@ Property / cites work @@
+Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard
+Normal rank
@@ Property / cites work @@
+Q5477811
@@ Property / cites work: Q5477811 / rank @@
+Normal rank
@@ Property / cites work @@
+Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method
+Normal rank
@@ Property / cites work @@
+Probability Inequalities for Sums of Bounded Random Variables
+Normal rank
@@ Property / cites work @@
+An annotated bibliography on 1-planarity
@@ Property / cites work: An annotated bibliography on 1-planarity / rank @@
+Normal rank
@@ Property / cites work @@
+New lower bound techniques for VLSI
@@ Property / cites work: New lower bound techniques for VLSI / rank @@
+Normal rank
@@ Property / cites work @@
+Q3496342
@@ Property / cites work: Q3496342 / rank @@
+Normal rank
@@ Property / cites work @@
+Improving the crossing lemma by finding more crossings in sparse graphs
+Normal rank
@@ Property / cites work @@
+Note on \(k\)-planar crossing numbers
@@ Property / cites work: Note on \(k\)-planar crossing numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs drawn with few crossings per edge
@@ Property / cites work: Graphs drawn with few crossings per edge / rank @@
+Normal rank
@@ Property / cites work @@
+Ein Sechsfarbenproblem auf der Kugel
@@ Property / cites work: Ein Sechsfarbenproblem auf der Kugel / rank @@
+Normal rank
@@ Property / cites work @@
+Crossing Numbers of Graphs
@@ Property / cites work: Crossing Numbers of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On \(k\)-planar crossing numbers
@@ Property / cites work: On \(k\)-planar crossing numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Crossing Numbers and Hard Erdős Problems in Discrete Geometry
+Normal rank