Degree constrained tree embedding into points in the plane
From MaRDI portal
Recommendations
- The rooted tree embedding problem into points in the plane
- Planar straight-line point-set embedding of trees with partial embeddings
- Planar embedding of trees on point sets without the general position assumption
- Point-Set Embedding of Trees with Edge Constraints
- Constrained point set embedding of a balanced binary tree
- Optimal Algorithms to Embed Trees in a Point Set
- Embedding nearly-spanning bounded degree trees
- Tight bounds for embedding bounded degree trees
- Point-set embeddings of plane 3-trees
- Degree conditions for embedding trees
Cites work
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- Graph theory
Cited in
(10)- Plane graphs with parity constraints
- Cubic plane graphs on a given point set
- A note on caterpillar-embeddings with no two parallel edges
- scientific article; zbMATH DE number 431516 (Why is no real title available?)
- Planar straight-line point-set embedding of trees with partial embeddings
- On triconnected and cubic plane graphs on given point sets
- Bipartite embeddings of trees in the plane
- On embedding triconnected cubic graphs on point sets
- A 75 angle constraint for plane minimal T1 trees
- Plane Graphs with Parity Constraints
This page was built for publication: Degree constrained tree embedding into points in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1208443)
