几乎完全部图的内禀纽结与内禀连通
Intrinsic knotting and linking of almost complete partite graphs
摘要：
我们分类图是0，1，或2个边缘短的是完全分图的内在联系和内在打结。此外，我们还对8顶点图的内在纽结进行了分类。对于这些族中的图，我们验证了Adams在《纽结书》中提出的一个猜想：如果从一个内在纽结图中去掉一个顶点，则得到一个内在连通图。
英文摘要：
We classify graphs that are 0, 1, or 2 edges short of being complete partite graphs with respect to intrinsic linking and intrinsic knotting. In addition, we classify intrinsic knotting of graphs on 8 vertices. For graphs in these families, we verify a conjecture presented in Adams' "The Knot Book": If a vertex is removed from an intrinsically knotted graph, one obtains an intrinsically linked graph.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
