Embedding graphs simultaneously with fixed edges

Authors:
Fabrizio Frati
Affiliations:
Dipartimento di Informatica e Automazione, Università di Roma Tre
Venue:
GD'06 Proceedings of the 14th international conference on Graph drawing
Year:
2006

Citing 4
Cited 15

Embedding planar graphs on the grid

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Embedding Planar Graphs at Fixed Vertex Locations

GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Two trees which are self–intersecting when drawn simultaneously

GD'05 Proceedings of the 13th international conference on Graph Drawing
Simultaneous embedding of planar graphs with few bends

GD'04 Proceedings of the 12th international conference on Graph Drawing

Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges

Graph-Theoretic Concepts in Computer Science
An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges

Graph Drawing
Computing upward topological book embeddings of upward planar digraphs

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Matched drawings of planar graphs

GD'07 Proceedings of the 15th international conference on Graph drawing
Constrained simultaneous and near-simultaneous embeddings

GD'07 Proceedings of the 15th international conference on Graph drawing
Simultaneous geometric graph embeddings

GD'07 Proceedings of the 15th international conference on Graph drawing
Matched drawability of graph pairs and of graph triples

Computational Geometry: Theory and Applications
Testing planarity of partially embedded graphs

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On a tree and a path with no geometric simultaneous embedding

GD'10 Proceedings of the 18th international conference on Graph drawing
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected graph or a tree

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges

Computational Geometry: Theory and Applications
Simultaneous embedding of embedded planar graphs

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph

Journal of Discrete Algorithms
Packing and squeezing subgraphs into planar graphs

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Planar packing of binary trees

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

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.