Matched Drawability of Graph Pairs and of Graph Triples

Authors:
Luca Grilli;Seok-Hee Hong;Giuseppe Liotta;Henk Meijer;Stephen K. Wismath
Affiliations:
Dip. di Ingegneria Elettronica e dell'Informazione, Università degli Studi di Perugia,;School of Information Technologies, University of Sydney,;Dip. di Ingegneria Elettronica e dell'Informazione, Università degli Studi di Perugia,;Science Department, Roosevelt Academy, The Netherlands;Department of Mathematics and Computer Science, University of Lethbridge,
Venue:
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Year:
2009

Citing 8
Cited 0

Drawing graphs: methods and models

Drawing graphs: methods and models
On simultaneous planar graph embeddings

Computational Geometry: Theory and Applications
VisLink: Revealing Relationships Amongst Visualizations

IEEE Transactions on Visualization and Computer Graphics
Characterization of unlabeled level planar trees

GD'06 Proceedings of the 14th international conference on Graph drawing
Characterization of unlabeled level planar graphs

GD'07 Proceedings of the 15th international conference on Graph drawing
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
Two trees which are self–intersecting when drawn simultaneously

GD'05 Proceedings of the 13th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The contribution of this paper is twofold. It presents a new approach to the matched drawability problem of pairs of planar graphs and provides three algorithms based on this approach for drawing the pairs outerplane-outerpillar, outerplane-wheel and wheel-wheel. Further, it initiates the study of the matched drawability of triples of planar graphs: It presents an algorithm to compute a matched drawing of a triple of cycles and an algorithm to compute a matched drawing of a caterpillar and two universal level planar graphs. The results extend previous work on the subject and relate to existing literature about simultaneous embeddability and universal level planarity.