1 paper
Santiago T. Adams, S. R. Kingan
A non-planar graph is almost-planar if either deleting or contracting any edge makes it planar. A graph with n vertices is pancyclic if it contains a cycle of every length from $…