1. Matched drawability of graph pairs and of graph triples
- Author
-
Grilli, Luca, Hong, Seok-Hee, Liotta, Giuseppe, Meijer, Henk, and Wismath, Stephen K.
- Subjects
- *
COMBINATORIAL geometry , *GRAPH theory , *ALGORITHMS , *EMBEDDINGS (Mathematics) , *MATHEMATICAL analysis , *GEOMETRIC analysis - Abstract
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. [Copyright &y& Elsevier]
- Published
- 2010
- Full Text
- View/download PDF