Pages that link to "Item:Q1594599"
From MaRDI portal
The following pages link to Lower bounds on the number of crossing-free subgraphs of \(K_N\) (Q1594599):
Displayed 13 items.
- Planar tree transformation: results and counterexample (Q975528) (← links)
- On the diameter of geometric path graphs of points in convex position (Q976134) (← links)
- Transforming spanning trees: A lower bound (Q1028225) (← links)
- A better upper bound on the number of triangulations of a planar point set (Q1873821) (← links)
- A lower bound on the number of triangulations of planar point sets (Q1882855) (← links)
- Disjoint compatible geometric matchings (Q1942309) (← links)
- A combinatorial property on angular orders of plane point sets (Q1944953) (← links)
- On numbers of pseudo-triangulations (Q1947983) (← links)
- Connecting polygonizations via stretches and twangs (Q1959392) (← links)
- On the number of plane geometric graphs (Q2373434) (← links)
- On the number of pseudo-triangulations of certain point sets (Q2474495) (← links)
- Hamiltonian Alternating Paths on Bicolored Double-Chains (Q3611851) (← links)
- Sequences of spanning trees and a fixed tree theorem (Q5959551) (← links)