Matched drawability of graph pairs and of graph triples

详细信息    查看全文

• 作者：Luca Grilli ; Seok-Hee Hong ; Giuseppe Liotta ; Henk Meijer ; Stephen K. Wismath
• 关键词：Graph drawing ; Matched drawings
• 刊名：Computational Geometry
• 出版年：2010
• 出版时间：August 2010
• 年：2010
• 卷：43
• 期：6-7
• 页码：611-634
• 全文大小：751 K

文摘

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 , outerplane,generalized outerpath, 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 unlabeled level planar graphs. The results extend previous work on the subject and relate to existing literature about simultaneous embeddability and unlabeled level planarity.