Intrinsically spherical 3-linked graphs

MaRDI QIDQ6373197zbMATH OpenFDO

Authors Madeleine Burkhart, Andrew Z. Castillo, Jonathan P. Doane, Joel Foisy, Cristopher Negron

Publication date 19 July 2021

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Relations of low-dimensional topology with graph theory (57M15)

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 ($S^1$s) and two disjoint vertices ($S^0$), 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 $S^0$).

This page was built for publication: Intrinsically spherical 3-linked graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6373197)