3 citations · 3 across the 1 of their papers we have counts for
1 paper · 1 filter
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…