7 citations · 10 across the 2 of their papers we have counts for
2 papers
math.GT2007★ 7 cited
Intrinsic knotting and linking of almost complete graphs
J. Campbell, T. W. Mattman, R. Ottman +3
We introduce new sufficient conditions for intrinsic knotting and linking. A graph on n vertices with at least 4n-9 edges is intrinsically linked. A graph on n vertices with at lea…
math.GT2003★ 3 cited
Intrinsic knotting and linking of almost complete partite graphs
Thomas W. Mattman, Ryan Ottman, Matt Rodrigues
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 kno…