paper

Intrinsically spherical 3-linked graphs

arXiv:2107.08953

Abstract

We exhibit several families of planar graphs that are minor-minimal intrinsically spherical -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 (s) and two disjoint vertices (), or a cycle and two pairs of disjoint vertices. We conjecture that , , and 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 ).

24 pages, 54 figures