Embedding Graphs Simultaneously with Fixed Edges

Frati, Fabrizio (2007) Embedding Graphs Simultaneously with Fixed Edges. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006 , pp. 108-113(Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_12).

Full text not available from this repository.

Abstract

We show that a planar graph and a tree can always be simultaneously embedded with fixed edges and that two outerplanar graphs generally cannot.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-540-70904-6_12
Classifications: M Methods > M.999 Others
G Algorithms and Complexity > G.490 Embeddings
M Methods > M.700 Planarization-based
URI: http://gdea.informatik.uni-koeln.de/id/eprint/766

Actions (login required)

View Item View Item