Bipartite embeddings of trees in the plane

0.00 Avg rating—0 Votes

Article ID:	iaor20001716
Country:	Netherlands
Volume:	93
Issue:	2/3
Start Page Number:	141
End Page Number:	148
Publication Date:	Jul 1999
Journal:	Discrete Applied Mathematics
Authors:	Abellanas M., Garca J., Hernndez G., Noy Marc, Ramos P.

Abstract:

In this paper we consider the following embedding problem. A point set P in the plane in general position is partitioned into two disjoint sets R and B, and we are asked to embed a tree T in P without crossings and with the additional property that all the edges connect a point in R to another point in B. We study several problems related to such bipartite embeddings.

Reviews

Required fields are marked *. Your email address will not be published.