Pages that link to "Item:Q5953078"
From MaRDI portal
The following pages link to Every set of disjoint line segments admits a binary tree (Q5953078):
Displaying 14 items.
- Convex partitions with 2-edge connected dual graphs (Q652620) (← links)
- Pointed binary encompassing trees: simple and optimal (Q733553) (← links)
- Vertex-colored encompassing graphs (Q742604) (← links)
- Alternating paths along axis-parallel segments (Q882782) (← links)
- Compatible geometric matchings (Q924079) (← links)
- Augmenting the connectivity of geometric graphs (Q929747) (← links)
- A vertex-face assignment for plane graphs (Q1025293) (← links)
- Segment endpoint visibility graphs are Hamiltonian (Q1395575) (← links)
- Disjoint compatible geometric matchings (Q1942309) (← links)
- Disjoint compatibility graph of non-crossing matchings of points in convex position (Q2263780) (← links)
- Compatible spanning trees (Q2444309) (← links)
- Encompassing colored planar straight line graphs (Q2456662) (← links)
- Convex Partitions with 2-Edge Connected Dual Graphs (Q5323063) (← links)
- THE MINIMUM GUARDING TREE PROBLEM (Q5411806) (← links)
