@Article{CMR-30-2,
author = {Yang, Li},
title = {Intrinsic Knotting of Almost Complete Partite Graphs},
journal = {Communications in Mathematical Research },
year = {2014},
volume = {30},
number = {2},
pages = {183--192},
abstract = {<p style="text-align: justify;">Let $G$ be a complete $p$-partite graph with 2 edges removed, $p ≥ 7$, which is
intrinsically knotted. Let $J$ represent any graph obtained from $G$ by a finite sequence
of $∆-Y$ exchanges and/or vertex expansions. In the present paper, we show that
the removal of any vertex of $J$ and all edges incident to that vertex produces an
intrinsically linked graph. This result offers more intrinsically knotted graphs which
hold for the conjecture presented in Adams&#39; book (Adams C. The Knot Book. New
York: W. H. Freeman and Company, 1994), that is, the removal of any vertex from
an intrinsically knotted graph yields an intrinsically linked graph.</p>},
issn = {2707-8523},
doi = {https://doi.org/10.13447/j.1674-5647.2014.02.09},
url = {https://global-sci.com/article/81751/intrinsic-knotting-of-almost-complete-partite-graphs}
}