Pages that link to "Item:Q1946734"
From MaRDI portal
The following pages link to Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique (Q1946734):
Displaying 22 items.
- Counting carambolas (Q293619) (← links)
- Crossings in grid drawings (Q405129) (← links)
- Monotone paths in geometric triangulations (Q726107) (← links)
- On \(k\)-gons and \(k\)-holes in point sets (Q899713) (← links)
- A QPTAS for the base of the number of crossing-free structures on a planar point set (Q1698728) (← links)
- Colored ray configurations (Q1699300) (← links)
- Algorithmic enumeration of surrounding polygons (Q1983143) (← links)
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices (Q2207612) (← links)
- Counting polygon triangulations is hard (Q2223620) (← links)
- On compatible matchings (Q2232249) (← links)
- Counting triangulations and other crossing-free structures via onion layers (Q2351010) (← links)
- Circumscribing polygons and polygonizations for disjoint line segments (Q2671176) (← links)
- On the Bounded-Hop Range Assignment Problem (Q3449812) (← links)
- Convex Polygons in Geometric Triangulations (Q3449827) (← links)
- Crossing-Free Perfect Matchings in Wheel Point Sets (Q4604397) (← links)
- On Compatible Matchings (Q5049995) (← links)
- Packing 1-plane Hamiltonian cycles in complete geometric graphs (Q5080782) (← links)
- (Q5088936) (← links)
- (Q5088963) (← links)
- Area Optimal Polygonization Using Simulated Annealing (Q5102071) (← links)
- Area-Optimal Simple Polygonalizations: The CG Challenge 2019 (Q5102073) (← links)
- Convex Polygons in Geometric Triangulations (Q5366966) (← links)
