Straight line embeddings of rooted star forests in the plane

DOI10.1016/S0166-218X(99)00191-2zbMath0942.05017OpenAlexW1992416537MaRDI QIDQ1975369

Atsushi Kaneko, Mikio Kano

Publication date: 6 August 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00191-2

zbMATH Keywords

star foreststraight-line embedding

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (10)

IMPROVED ALGORITHMS FOR THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE 3-TREES ⋮ Alternating paths and cycles of minimum length ⋮ Discrete geometry on colored point sets in the plane -- a survey ⋮ Universal point sets for 2-coloured trees ⋮ On the curve complexity of 3-colored point-set embeddings ⋮ Point-set embeddings of trees with given partial drawings ⋮ SEMI-BALANCED PARTITIONS OF TWO SETS OF POINTS AND EMBEDDINGS OF ROOTED FORESTS ⋮ CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS ⋮ Constrained Point-Set Embeddability of Planar Graphs ⋮ ON EMBEDDING A GRAPH ON TWO SETS OF POINTS

Cites Work

• Unnamed Item
• How to draw a planar graph on a grid
• Straight-line embeddings of two rooted trees in the plane
• The rooted tree embedding problem into points in the plane
• Balanced partitions of two sets of points in the plane
• On a straight-line embedding problem of graphs

This page was built for publication: Straight line embeddings of rooted star forests in the plane