Pages that link to "Item:Q1817003"
From MaRDI portal
The following pages link to Generating rooted triangulations without repetitions (Q1817003):
Displaying 15 items.
- Memory-efficient enumeration of constrained spanning trees (Q294700) (← links)
- Extending convex partial drawings of graphs (Q334920) (← links)
- Flips in planar graphs (Q950400) (← links)
- Planar tree transformation: results and counterexample (Q975528) (← links)
- An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps (Q982667) (← links)
- Untangling a planar graph (Q1042455) (← links)
- Inner diagonals of convex polytopes (Q1296758) (← links)
- Efficient generation of triconnected plane triangulations. (Q1428112) (← links)
- Efficient generation of plane trees. (Q1853129) (← links)
- On planar path transformation (Q2379998) (← links)
- Graphs of triangulations and perfect matchings (Q2573802) (← links)
- SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS (Q4818577) (← links)
- Transformations for maximal planar graphs with minimum degree five (Q6085725) (← links)
- Family Trees for Enumeration (Q6087777) (← links)
- Enumerating floorplans with walls (Q6143840) (← links)