1 paper
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…