1 citations · 1 across the 1 of their papers we have counts for
1 paper
Chris Cicotta, Joel Foisy, Tom Reilly +3
A graph G is intrinsically S^1-linked if for every embedding of the vertices of G into S^1, vertices that form the endpoints of two disjoint edges in G form a non-split link in the…