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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.