Nika Salia

Saturated Partial Embeddings of Planar Graphs

ABSTRACT In this work, we study how far one can deviate from optimal behavior when embedding a planar graph. For a planar graph , we say that a plane subgraph is a plane‐saturated subgraph if adding any edge (possibly with new vertices) to would either violate planarity or make t...