1 paper · 1 filter
Max Aires
A maximally linkless graph is a graph that can be embedded in R3 without any links, but cannot be embedded in such a way if any other edge is added to the graph. Recent…