1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.CO2024
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…
math.CO2022★ 1 cited
Complete Minors in Complements of Non-Separating Planar Graphs
Leonard Fowler, Gregory Li, Andrei Pavelescu
We prove that the complement of any non-separating planar graph of order contains a minor, and argue that the order is lowest possible with this property. To il…