On the red/blue spanning tree problem (Q534557): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2010.10.038
+Normal rank
@@ Property / OpenAlex ID @@
+W2149317979
@@ Property / OpenAlex ID: W2149317979 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar bichromatic minimum spanning trees
@@ Property / cites work: Planar bichromatic minimum spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+On the convex layers of a planar set
@@ Property / cites work: On the convex layers of a planar set / rank @@
+Normal rank
@@ Property / cites work @@
+Q5786239
@@ Property / cites work: Q5786239 / rank @@
+Normal rank
@@ Property / cites work @@
+How to draw a planar graph on a grid
@@ Property / cites work: How to draw a planar graph on a grid / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Crossing Number is NP-Complete
@@ Property / cites work: Crossing Number is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+Crossing number is hard for cubic graphs
@@ Property / cites work: Crossing number is hard for cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549636
@@ Property / cites work: Q3549636 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank