The minimal nonplanar strong digraphs
Abstract
Kuratowski's theorem says that the minimal (under subgraph containment) graphs that are not planar are the subdivisions of K5 and of K3,3. Here we study the minimal (under subdigraph containment) strongly-connected digraphs that are not planar. We also find the minimal strongly-connected non-outerplanar digraphs and the minimal strongly-connected non-series-parallel digraphs.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.