?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.title=Two+trees+which+are+self-intersecting+when+drawn+simultaneously&rft.creator=Kaufmann%2C+Michael&rft.creator=Vrto%2C+Imrich&rft.creator=Geyer%2C+Markus&rft.subject=Z.500+Representations&rft.subject=M.900+Tree&rft.subject=P.720+Straight-line&rft.subject=G.490+Embeddings&rft.subject=G.560+Geometry&rft.description=An+actual+topic+in+the+graph+drawing+is+the+question+how+to+draw+two+edge+sets+on+the+same+vertex+set%2C+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%2C+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.%0D%0A++++&rft.publisher=Springer&rft.contributor=Healy%2C+Patrick&rft.contributor=Nikolov%2C+Nikola+S.&rft.date=2006&rft.type=Conference+Paper&rft.type=NonPeerReviewed&rft.identifier=Kaufmann%2C+Michael+and+Vrto%2C+Imrich+and+Geyer%2C+Markus+(2006)+Two+trees+which+are+self-intersecting+when+drawn+simultaneously.+[Conference+Paper]&rft.relation=http%3A%2F%2Fgdea.informatik.uni-koeln.de%2F692%2F