Universal point sets for 2-coloured trees
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2209732 (Why is no real title available?)
- A better upper bound on the number of triangulations of a planar point set
- Bipartite embeddings of trees in the plane
- Colored simultaneous geometric embeddings and universal pointsets
- Point-set embeddings of trees with given partial drawings
- SEMI-BALANCED PARTITIONS OF TWO SETS OF POINTS AND EMBEDDINGS OF ROOTED FORESTS
- Straight line embeddings of rooted star forests in the plane
- Straight-line embeddings of two rooted trees in the plane
- The rooted tree embedding problem into points in the plane
Cited in
(6)
This page was built for publication: Universal point sets for 2-coloured trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436323)