3 papers
math.CO2026
New minor minimal non-apex graphs
Andrei Pavelescu, Elena Pavelescu, Madeline Potter
A graph is apex if it becomes planar after the deletion of one vertex. The family of apex graphs is closed under taking minors, so it is characterized by a finite set of forbidden…
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.CO2024
The total chord length of maximal outerplanar graphs
Haley Broadus, Elena Pavelescu
We consider embeddings of maximal outerplanar graphs whose vertices all lie on a cycle bounding a face. Each edge of the graph that is not in , a chord,…