Drawing Graphs with Right Angle Crossings (Q3183456): Difference between revisions

@@ Property / cites work @@
+On the maximum number of edges in quasi-planar graphs
+Normal rank
@@ Property / cites work @@
+Quasi-planar graphs have a linear number of edges
@@ Property / cites work: Quasi-planar graphs have a linear number of edges / rank @@
+Normal rank
@@ Property / cites work @@
+Representations of Planar Graphs
@@ Property / cites work: Representations of Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3154375
@@ Property / cites work: Q3154375 / rank @@
+Normal rank
@@ Property / cites work @@
+Triangles in Euclidean arrangements
@@ Property / cites work: Triangles in Euclidean arrangements / rank @@
+Normal rank
@@ Property / cites work @@
+Graph drawing software
@@ Property / cites work: Graph drawing software / rank @@
+Normal rank
@@ Property / cites work @@
+Drawing graphs. Methods and models
@@ Property / cites work: Drawing graphs. Methods and models / rank @@
+Normal rank
@@ Property / cites work @@
+Q3154374
@@ Property / cites work: Q3154374 / rank @@
+Normal rank
@@ Property / cites work @@
+Improving the crossing lemma by finding more crossings in sparse graphs
+Normal rank
@@ Property / cites work @@
+Discrete and Computational Geometry
@@ Property / cites work: Discrete and Computational Geometry / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient orthogonal drawings of high degree graphs
+Normal rank
@@ Property / cites work @@
+Empirical evaluation of aesthetics-based graph layout
+Normal rank
@@ Property / cites work @@
+The maximum number of triangles in arrangements of pseudolines
+Normal rank