Embedding Graphs into Embedded Graphs

Abstract

A (possibly degenerate) drawing of a graphGin the plane is approximable by an embedding if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing whether a piece-wise linear drawing of a planar graphGin the plane is approximable by an embedding can be carried out in polynomial time, if a desired embedding ofGbelongs to a fixed isotopy class. In other words, we show that c-planarity with embedded pipes is tractable for graphs with prescribed combinatorial embedding. To the best of our knowledge, an analogous result was previously known essentially only whenGis a cycle.