Planar tree transformation: results and counterexample (Q975528): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2008.09.005
+Normal rank
@@ Property / OpenAlex ID @@
+W1969338258
@@ Property / OpenAlex ID: W1969338258 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q124977496
@@ Property / Wikidata QID: Q124977496 / rank @@
+Normal rank
@@ Property / cites work @@
+On planar path transformation
@@ Property / cites work: On planar path transformation / rank @@
+Normal rank
@@ Property / cites work @@
+Generating rooted triangulations without repetitions
+Normal rank
@@ Property / cites work @@
+Reverse search for enumeration
@@ Property / cites work: Reverse search for enumeration / rank @@
+Normal rank
@@ Property / cites work @@
+Flips in planar graphs
@@ Property / cites work: Flips in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on the number of crossing-free subgraphs of \(K_N\)
+Normal rank
@@ Property / cites work @@
+On local transformation of polygons with visibility properties.
+Normal rank
@@ Property / cites work @@
+Geometric tree graphs of points in convex position
+Normal rank
@@ Property / cites work @@
+Transforming triangulations
@@ Property / cites work: Transforming triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+On connectivities of tree graphs
@@ Property / cites work: On connectivities of tree graphs / rank @@
+Normal rank