title: Two trees which are self-intersecting when drawn simultaneously
creator: Kaufmann, Michael
creator: Vrto, Imrich
creator: Geyer, Markus
subject: Z.500 Representations
subject: M.900 Tree
subject: P.720 Straight-line
subject: G.490 Embeddings
subject: G.560 Geometry
description: An actual topic in the graph drawing is the question how to draw two edge sets on the same vertex set, the so-called simultaneous drawing of graphs. The goal is to simultaneously find a nice drawing for both of the sets. It has been found out that only restricted classes of planar graphs can be drawn simultaneously using straight lines and without crossings within the same edge set. In this paper, we negatively answer one of the most often posted open questions namely whether any two trees with the same vertex set can be drawn simultaneously crossing-free in a straight line way.      
publisher: Springer
contributor: Healy, Patrick
contributor: Nikolov, Nikola S.
date: 2006
type: Conference Paper
type: NonPeerReviewed
identifier: Kaufmann, Michael and Vrto, Imrich and Geyer, Markus (2006) Two trees which are self-intersecting when drawn simultaneously. [Conference Paper]
relation: http://gdea.informatik.uni-koeln.de/692/