Degree constrained tree embedding into points in the plane
From MaRDI portal
Publication:1208443
DOI10.1016/0020-0190(92)90087-CzbMATH Open0768.68184MaRDI QIDQ1208443FDOQ1208443
Authors: Akihisa Tamura, Yoshiko Tamura 
Publication date: 16 May 1993
Published in: Information Processing Letters (Search for Journal in Brave)
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
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
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
- Title not available (Why is that?)
- 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
- Plane Graphs with Parity Constraints
- A \(75\degree\) angle constraint for plane minimal T1 trees
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)
