The Number of Flips Required to Obtain Non-crossing Convex Cycles (Q5302750): Difference between revisions

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-89550-3_17
+Normal rank
@@ Property / OpenAlex ID @@
+W17101045
@@ Property / OpenAlex ID: W17101045 / rank @@
+Normal rank
@@ Property / cites work @@
+Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
+Normal rank
@@ Property / cites work @@
+Q2934725
@@ Property / cites work: Q2934725 / rank @@
+Normal rank
@@ Property / cites work @@
+The diameters of some transition graphs constructed from Hamilton cycles
+Normal rank
@@ Property / cites work @@
+Lengths of tours and permutations on a vertex set of a convex polygon.
+Normal rank
@@ Property / cites work @@
+Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon
+Normal rank
@@ Property / cites work @@
+Q4461913
@@ Property / cites work: Q4461913 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3216469
@@ Property / cites work: Q3216469 / rank @@
+Normal rank
@@ Property / cites work @@
+Untangling a polygon
@@ Property / cites work: Untangling a polygon / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5302750