Intrinsically knotted graphs and connected domination

Gregory Li, Andrei Pavelescu, Elena Pavelescu

We classify all the maximal linklessly embeddable graphs of order 12 and show that their complements are all intrinsically knotted. We derive results about the connected domination…