Encompassing colored planar straight line graphs (Q2456662): Difference between revisions

@@ Property / cites work @@
+Simple alternating path problem
@@ Property / cites work: Simple alternating path problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4821338
@@ Property / cites work: Q4821338 / rank @@
+Normal rank
@@ Property / cites work @@
+Every set of disjoint line segments admits a binary tree
+Normal rank
@@ Property / cites work @@
+Growing a Tree from Its Branches
@@ Property / cites work: Growing a Tree from Its Branches / rank @@
+Normal rank
@@ Property / cites work @@
+Alternating paths through disjoint line segments
@@ Property / cites work: Alternating paths through disjoint line segments / rank @@
+Normal rank
@@ Property / cites work @@
+Segment endpoint visibility graphs are Hamiltonian
+Normal rank
@@ Property / cites work @@
+Q4504022
@@ Property / cites work: Q4504022 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5692715
@@ Property / cites work: Q5692715 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4547805
@@ Property / cites work: Q4547805 / rank @@
+Normal rank
@@ Property / cites work @@
+ALTERNATING HAMILTON CYCLES WITH MINIMUM NUMBER OF CROSSINGS IN THE PLANE
+Normal rank
@@ Property / cites work @@
+Problem-solving through problems
@@ Property / cites work: Problem-solving through problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3799261
@@ Property / cites work: Q3799261 / rank @@
+Normal rank
@@ Property / cites work @@
+On circumscribing polygons for line segments
@@ Property / cites work: On circumscribing polygons for line segments / rank @@
+Normal rank
@@ Property / cites work @@
+Illuminating disjoint line segments in the plane
@@ Property / cites work: Illuminating disjoint line segments in the plane / rank @@
+Normal rank