Matched drawability of graph pairs and of graph triples

Authors:
Luca Grilli;Seok-Hee Hong;Giuseppe Liotta;Henk Meijer;Stephen K. Wismath
Affiliations:
Dipartimento di Ingegneria Elettronica e dell'Informazione, Università degli Studi di Perugia, Italy;School of Information Technologies, University of Sydney, Australia;Dipartimento di Ingegneria Elettronica e dell'Informazione, Università degli Studi di Perugia, Italy;Science Department, Roosevelt Academy, The Netherlands;Department of Mathematics & Computer Science, University of Lethbridge, Canada
Venue:
Computational Geometry: Theory and Applications
Year:
2010

Citing 11
Cited 0

Drawing graphs: methods and models

Drawing graphs: methods and models
Level Planarity Testing in Linear Time

GD '98 Proceedings of the 6th International Symposium on Graph Drawing
On simultaneous planar graph embeddings

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

IEEE Transactions on Visualization and Computer Graphics
Simultaneous graph embedding with bends and circular arcs

Computational Geometry: Theory and Applications
Characterization of unlabeled level planar trees

Computational Geometry: Theory and Applications
Embedding graphs simultaneously with fixed edges

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
Simultaneous geometric graph embeddings

GD'07 Proceedings of the 15th international conference on Graph drawing
Geometric simultaneous embeddings of a graph and a matching

GD'09 Proceedings of the 17th international conference on Graph Drawing
Colored simultaneous geometric embeddings

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics

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 it provides four algorithms based on this approach for drawing the pairs , , and . 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 unlabeled level planar graphs. The results extend previous work on the subject and relate to existing literature about simultaneous embeddability and unlabeled level planarity.