gdea_3Two trees which are self-intersecting when drawn simultaneouslyMichaelKaufmannauthorImrichVrtoauthorMarkusGeyerauthorAn 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. Z.500 RepresentationsM.900 TreeP.720 Straight-lineG.490 EmbeddingsG.560 Geometry2006SpringerConference Paper

For work being deposited by its own author: In self-archiving this collection of files and associated bibliographic metadata, I grant gdea the right to store them and to make them permanently available publicly for free on-line. I declare that this material is my own intellectual property and I understand that gdea does not assume any responsibility if there is any breach of copyright in distributing these files or metadata. (All authors are urged to prominently assert their copyright on the title page of their work.)

For work being deposited by someone other than its author: I hereby declare that the collection of files and associated bibliographic metadata that I am archiving at gdea) is in the public domain. If this is not the case, I accept full responsibility for any breach of copyright that distributing these files or metadata may entail.

Clicking on the deposit button indicates your agreement to these terms.