Planar graphs with separation are dp-minimal
arXiv:2205.10204
Abstract
We prove that given a planar embedding of a graph in the sphere the expansion of the graph structure by predicates encoding separation of vertices by simple cycles of the graph is dp-minimal.