Triangle-Y exchanges on intrinsic knotting of almost complete and complete partite graphs

Let G be a 0-or 1-deficient graph which is intrinsically knotted, let J represent any graph obtained from G by a finite sequence of δ-Y exchanges and/or vertex expansions. We prove that removing any vertex of J, and all edges incident to that vertex, yields an intrinsically linked graph. This result provides more intrinsically knotted graphs which satisfy the conjecture mentioned in Adams' The Knot Book that removing any vertex from an intrinsically knotted graph yields an intrinsically linked graph.