Pages that link to "Item:Q2373434"

The following pages link to On the number of plane geometric graphs (Q2373434):

Displaying 30 items.

• Configurations of non-crossing rays and related problems (Q282735) (← links)
• Counting carambolas (Q293619) (← links)
• On the number of crossing-free partitions (Q359753) (← links)
• Counting triangulations of some classes of subdivided convex polygons (Q518180) (← links)
• Flips in planar graphs (Q950400) (← links)
• Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees (Q967420) (← links)
• Order on order types (Q1650795) (← links)
• Point sets with many non-crossing perfect matchings (Q1699275) (← links)
• Colored ray configurations (Q1699300) (← 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)
• Perfect matchings with crossings (Q2169938) (← 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)
• Twenty years of progress of \(\mathrm{JCDCG}^3\) (Q2308489) (← links)
• A new lower bound on the maximum number of plane graphs using production matrices (Q2331222) (← links)
• Counting triangulations and other crossing-free structures approximately (Q2341692) (← links)
• Counting triangulations and other crossing-free structures via onion layers (Q2351010) (← links)
• The Mathematics of Ferran Hurtado: A Brief Survey (Q2958111) (← links)
• Counting Plane Graphs with Exponential Speed-Up (Q3003469) (← links)
• Convex Polygons in Geometric Triangulations (Q3449827) (← links)
• (Q5088963) (← links)
• Geometry and Generation of a New Graph Planarity Game (Q5233138) (← 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)
• Convex Polygons in Geometric Triangulations (Q5366966) (← links)
• Counting Plane Graphs: Cross-Graph Charging Schemes (Q5397740) (← links)
• Fast enumeration algorithms for non-crossing geometric graphs (Q5896957) (← links)
• Transition operations over plane trees (Q5918848) (← links)
• Perfect matchings with crossings (Q6119827) (← links)