The following pages link to Flips in planar graphs (Q950400):
Displaying 42 items.
- The edge rotation graph (Q367068) (← links)
- Flipping triangles and rectangles (Q386439) (← links)
- Making triangulations 4-connected using flips (Q390117) (← links)
- A lower bound on the diameter of the flip graph (Q521362) (← links)
- Amortized efficiency of generating planar paths in convex position (Q638510) (← links)
- Complexity of token swapping and its variants (Q722547) (← links)
- On the rotation distance between binary trees (Q846983) (← links)
- Flip distance between triangulations of a simple polygon is NP-complete (Q894685) (← links)
- Flip distance between two triangulations of a point set is NP-complete (Q906837) (← links)
- Planar tree transformation: results and counterexample (Q975528) (← links)
- On the diameter of geometric path graphs of points in convex position (Q976134) (← links)
- A model to simplify 2D triangle meshes with irregular shapes (Q984322) (← links)
- Arc diagrams, flip distances, and Hamiltonian triangulations (Q1699291) (← links)
- Flipping edge-labelled triangulations (Q1699301) (← links)
- Reconfiguration on sparse graphs (Q1747496) (← links)
- Geometric quadrangulations of a polygon (Q1792062) (← links)
- Connecting polygonizations via stretches and twangs (Q1959392) (← links)
- Flipping in spirals (Q1984590) (← links)
- Transforming plane triangulations by simultaneous diagonal flips (Q2032161) (← links)
- Quadrangulations of a polygon with spirality (Q2051896) (← links)
- Elimination properties for minimal dominating sets of graphs (Q2107746) (← links)
- Flip graphs of stacked and flag triangulations of the 2-sphere (Q2138560) (← links)
- Flip graphs, Yoke graphs and diameter (Q2209266) (← links)
- Thompson's group \(\mathcal T\) is the orientation-preserving automorphism group of a cellular complex (Q2248220) (← links)
- Convex dominating sets in maximal outerplanar graphs (Q2312656) (← links)
- Flip distance to some plane configurations (Q2331207) (← links)
- On planar path transformation (Q2379998) (← links)
- Computing the flip distance between triangulations (Q2408209) (← links)
- A proof of the orbit conjecture for flipping edge-labelled triangulations (Q2415384) (← links)
- Flip distance between triangulations of a planar point set is APX-hard (Q2444311) (← links)
- Flip graphs of bounded degree triangulations (Q2637710) (← links)
- Packing disks by flipping and flowing (Q2665260) (← links)
- Flip Graphs of Bounded-Degree Triangulations (Q2851510) (← links)
- The Mathematics of Ferran Hurtado: A Brief Survey (Q2958111) (← links)
- Reducing Urban Concentration Using a Neural Network Model (Q3405723) (← links)
- Rainbow Cycles in Flip Graphs. (Q5115806) (← links)
- Flip Distance to some Plane Configurations. (Q5116475) (← links)
- Kernelization of Whitney Switches (Q5874518) (← links)
- Quasipolynomiality of the Smallest Missing Induced Subgraph (Q6051910) (← links)
- Complexity results on untangling red-blue matchings (Q6101837) (← links)
- How close is a quad mesh to a polycube? (Q6101842) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
