Matched drawability of graph pairs and of graph triples (Q982951): Difference between revisions

The concept of matched drawability of a pair of planar graphs was introduced and studied in [\textit{E. Di Giacomo, W. Didimo, M. van Kreveld, G. Liotta} and \textit{B. Speckmann} [J. Graph Algorithms Appl. 13, No.~3, 423--445 (2009; Zbl 1202.05092)]. The authors extend the results of this paper in different directions. Showing that not all planar pairs are matched drawable, the authors describe the meaningful pairs of planar graphs that always admit a matched drawing. The matched drawability of a triple of planar graphs is also introduced and studied. Using this concept the authors find new differences between matched drawability and simultaneous drawability. 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 isgiven. At the end of the paper some open problems are also stated.