Transforming spanning trees: A lower bound (Q1028225): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.comgeo.2008.03.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2147388254
@@ Property / OpenAlex ID: W2147388254 / rank @@
+Normal rank
@@ Property / cites work @@
+Transforming spanning trees and pseudo-triangulations
+Normal rank
@@ Property / cites work @@
+Sequences of spanning trees and a fixed tree theorem
+Normal rank
@@ Property / cites work @@
+Compatible Geometric Matchings
@@ Property / cites work: Compatible Geometric Matchings / rank @@
+Normal rank
@@ Property / cites work @@
+A quadratic distance bound on sliding between crossing-free spanning trees
+Normal rank
@@ Property / cites work @@
+Reverse search for enumeration
@@ Property / cites work: Reverse search for enumeration / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on the number of crossing-free subgraphs of \(K_N\)
+Normal rank
@@ Property / cites work @@
+Geometric tree graphs of points in convex position
+Normal rank
@@ Property / cites work @@
+Graphs of non-crossing perfect matchings
@@ Property / cites work: Graphs of non-crossing perfect matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs of triangulations and perfect matchings
@@ Property / cites work: Graphs of triangulations and perfect matchings / rank @@
+Normal rank