Every set of disjoint line segments admits a binary tree
From MaRDI portal
(Redirected from Publication:5953078)
Recommendations
- scientific article; zbMATH DE number 1555917
- Embeddings of binary trees in lines
- A disjoint unions theorem for trees
- Internally disjoint trees in the line graph and total graph of the complete bipartite graph
- scientific article; zbMATH DE number 1011081
- Boundary of complete binary trees
- Planar straight-line point-set embedding of trees with partial embeddings
- Lines, trees, and branch spaces
- Optimal distortion embedding of complete binary trees into lines
- Binary Trees and the n-Cutset Property
Cited in
(19)- A vertex-face assignment for plane graphs
- Segment endpoint visibility graphs are Hamiltonian
- Disjoint compatible geometric matchings
- Disjoint compatibility graph of non-crossing matchings of points in convex position
- On selecting leaves with disjoint neighborhoods in embedded trees
- Compatible spanning trees
- Encompassing colored planar straight line graphs
- scientific article; zbMATH DE number 1555917 (Why is no real title available?)
- Growing a Tree from Its Branches
- Algorithm Theory - SWAT 2004
- Convex Partitions with 2-Edge Connected Dual Graphs
- Pointed and colored binary encompassing trees
- THE MINIMUM GUARDING TREE PROBLEM
- Convex partitions with 2-edge connected dual graphs
- Pointed binary encompassing trees: simple and optimal
- Vertex-colored encompassing graphs
- Alternating paths along axis-parallel segments
- Compatible geometric matchings
- Augmenting the connectivity of geometric graphs
This page was built for publication: Every set of disjoint line segments admits a binary tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5953078)
