Intrinsically spherical 3-linked graphs
Abstract
We exhibit several families of planar graphs that are minor-minimal intrinsically spherical 3-linked. A graph is intrinsically spherical 3-linked if it is planar graph that has, in every spherical embedding, a non-split 3-link consisting of two disjoint cycles (S1s) and two disjoint vertices (S0), or a cycle and two pairs of disjoint vertices. We conjecture that K4 K4, K3,2 K3,2, and K4 K3,2 form the complete set of minor-minimal intrinsically type I spherical 3-linked graphs (that is, in every spherical embedding, have a nonsplit link of two cycles and one S0).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.