“…We draw the black, red and blue edges of G ′ along the edges of K incident with vertices 1, 2 and 3, respectively, so that they reach the special 4-cycles in H. Then we extend these twelve edges using vertex-disjoint paths in H, until they reach the boundary of D ′ . We draw the last portions of these edges inside D ′ , without having to use the embedding K. Due to the planarity of H, the cyclic orders of the colored vertices on the boundaries of the special 4-cycles are "linked" by the black, red and blue edges to opposite cyclic orders around the vertices of W ′ inside D ′ ; in particular, the rotation of each vertex of W ′ in the constructed drawing contains the cyclic subsequence (1,2,3). Moreover, we can make sure that the black and blue edges, incident to the vertices 1 and 3, respectively, are "accessible" from the boundary of H, while the red edges are "hidden".…”