A kuratowski-type theorem for planarity of partially embedded graphs
Vít Jelínek, Jan Kratochvı́l, Ignaz Rutter · 2011
A partially embedded graph (or PEG) is a triple (G,H,EH), where G is a graph, H is a subgraph of G, and EH is a planar embedding of H. We say that a PEG (G,H,EH) is planar if the graph G has a planar embedding that extends the embedding EH.