Pointed and colored binary encompassing trees
From MaRDI portal
Recommendations
Cited in
(8)- A vertex-face assignment for plane graphs
- Planar bichromatic minimum spanning trees
- Every set of disjoint line segments admits a binary tree
- Growing a Tree from Its Branches
- Pointed binary encompassing trees
- Pointed Brauer trees
- Pointed binary encompassing trees: simple and optimal
- Augmenting the connectivity of geometric graphs
This page was built for publication: Pointed and colored binary encompassing trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5370599)