A pair of trees without a simultaneous geometric embedding in the plane
| dc.creator | Kutz, Martin | |
| dc.date | 2005-10-18 | |
| dc.date | 2005-11-01 | |
| dc.date.accessioned | 2026-07-07T06:46:16Z | |
| dc.date.available | 2026-07-07T06:46:16Z | |
| dc.description | Any planar graph has a crossing-free straight-line drawing in the plane. A simultaneous geometric embedding of two n-vertex graphs is a straight-line drawing of both graphs on a common set of n points, such that the edges withing each individual graph do not cross. We consider simultaneous embeddings of two labeled trees, with predescribed vertex correspondences, and present an instance of such a pair that cannot be embedded. Further we provide an example of a planar graph that cannot be embedded together with a path when vertex correspondences are given. | |
| dc.description | This paper has been withdrawn by the author because it had turned out that the result was already known before | |
| dc.identifier | https://arxiv.org/abs/cs/0510053 | |
| dc.identifier | http://arxiv.org/abs/cs/0510053 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/103282 | |
| dc.subject | Computational Geometry | |
| dc.title | A pair of trees without a simultaneous geometric embedding in the plane | |
| dc.type | text |