On a Tree and a Path with no Geometric Simultaneous Embedding
On a Tree and a Path with no Geometric Simultaneous Embedding
Two graphs G1 = (V, E1) and G2 = (V, E2) admit a geometric simultaneous embedding if there exists a set of points P and a bijection M : P → V that induce planar straight-line embeddings both for G1 and for G2.While it is known that two caterpillars always …