Bounds on the crossing resolution of complete geometric graphs (Q765347): Difference between revisions

@@ Property / Wikidata QID @@
+Q62042447
@@ Property / Wikidata QID: Q62042447 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Perspectives Opened by Right Angle Crossing Drawings
+Normal rank
@@ Property / cites work @@
+Graphs that Admit Right Angle Crossing Drawings
@@ Property / cites work: Graphs that Admit Right Angle Crossing Drawings / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded-degree graphs have arbitrarily large geometric thickness
+Normal rank
@@ Property / cites work @@
+Drawing Graphs with Right Angle Crossings
@@ Property / cites work: Drawing Graphs with Right Angle Crossings / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of complete bipartite RAC graphs
+Normal rank
@@ Property / cites work @@
+Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings
+Normal rank
@@ Property / cites work @@
+Geometric Thickness of Complete Graphs
@@ Property / cites work: Geometric Thickness of Complete Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Drawing cubic graphs with at most five slopes
@@ Property / cites work: Drawing cubic graphs with at most five slopes / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric representation of cubic graphs with four directions
+Normal rank
@@ Property / cites work @@
+Bounded-degree graphs can have arbitrarily large slope numbers
+Normal rank