Pages that link to "Item:Q2847913"
From MaRDI portal
The following pages link to Counting Plane Graphs: Flippability and Its Applications (Q2847913):
Displaying 28 items.
- Configurations of non-crossing rays and related problems (Q282735) (← links)
- Counting carambolas (Q293619) (← links)
- Crossings in grid drawings (Q405129) (← links)
- Counting triangulations of planar point sets (Q540059) (← 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)
- Enumeration of rooted planar triangulations with respect to diagonal flips (Q1818215) (← links)
- Disjoint compatible geometric matchings (Q1942309) (← links)
- Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique (Q1946734) (← links)
- On numbers of pseudo-triangulations (Q1947983) (← links)
- Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees (Q2032154) (← links)
- Connectivity of triangulation flip graphs in the plane (Q2105329) (← links)
- Counting triangulations and other crossing-free structures approximately (Q2341692) (← links)
- Geometric biplane graphs. I: Maximal graphs (Q2345511) (← links)
- Lower bounds on the maximum number of non-crossing acyclic graphs (Q2346577) (← links)
- Counting triangulations and other crossing-free structures via onion layers (Q2351010) (← links)
- Counting Plane Graphs: Flippability and Its Applications (Q2847913) (← links)
- Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique (Q2874581) (← links)
- A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set (Q3448837) (← links)
- On Flattenability of Graphs (Q3452282) (← links)
- The polytope of non-crossing graphs on a planar point set (Q4657333) (← links)
- Simultaneously Flippable Edges in Triangulations (Q4899272) (← links)
- Counting Plane Graphs: Cross-Graph Charging Schemes (Q4912187) (← links)
- (Q5199270) (redirect page) (← links)
- Reconstruction of the Crossing Type of a Point Set from the Compatible Exchange Graph of Noncrossing Spanning Trees (Q5237063) (← links)
- A Census of Plane Graphs with Polyline Edges (Q5267999) (← links)
- Transition operations over plane trees (Q5918848) (← links)
- Non-crossing Hamiltonian paths and cycles in output-polynomial time (Q6614115) (← links)
