Straight-line embeddings of two rooted trees in the plane

DOI10.1007/PL00009441zbMath0934.05043MaRDI QIDQ1293679

Mikio Kano, Atsushi Kaneko

Publication date: 9 April 2000

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

rooted treestraight-line embedding

Mathematics Subject Classification ID

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

Related Items (10)

On triconnected and cubic plane graphs on given point sets ⋮ Alternating paths and cycles of minimum length ⋮ Geometric planar networks on bichromatic collinear points ⋮ On embedding triconnected cubic graphs on point sets ⋮ Universal point sets for 2-coloured trees ⋮ On the curve complexity of 3-colored point-set embeddings ⋮ Compatible spanning trees ⋮ SEMI-BALANCED PARTITIONS OF TWO SETS OF POINTS AND EMBEDDINGS OF ROOTED FORESTS ⋮ Straight line embeddings of rooted star forests in the plane ⋮ ON EMBEDDING A GRAPH ON TWO SETS OF POINTS

This page was built for publication: Straight-line embeddings of two rooted trees in the plane