Bipartite embedding of trees in the plane
Discrete Applied Mathematics
Straight line embeddings of rooted star forests in the plane
Discrete Applied Mathematics
Drawing colored graphs on colored points
Theoretical Computer Science
Point-set embeddings of trees with given partial drawings
Computational Geometry: Theory and Applications
Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices
Discrete & Computational Geometry
Colored simultaneous geometric embeddings
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |
Let R and B be two sets of distinct points such that the points of R are coloured red and the points of B are coloured blue. Let G be a family of planar graphs such that for each graph in the family |R| vertices are red and |B| vertices are blue. The set R∪B is a universal pointset for G if every graph G ∈ G has a straight-line planar drawing such that the blue vertices of G are mapped to the points of B and the red vertices of G are mapped to the points of R. In this paper we describe universal pointsets for meaningful classes of 2-coloured trees and show applications of these results to the coloured simultaneous geometric embeddability problem.