S. Kingan

activity

20192024

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2024

Pancyclicity of almost-planar graphs

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 $…

math.CO2021

Constructing minimally 3-connected graphs

J. P. Costalonga, R. J. Kingan, S. R. Kingan

A $3$ -connected graph is minimally 3-connected if removal of any edge destroys 3-connectivity. We present an algorithm for constructing minimally 3-connected graphs based on the re…

math.CO2019

A characterization of 2-neighborhood degree list of diameter 2 graphs

N. Benakli, E. Halleck, S. R. Kingan

Let $N_{2} D L (v)$ denote the set of degrees of vertices at distance 2 from $v$ . The $2$ -neighborhood degree list of a graph is a listing of $N_{2} D L (v)$ for every vertex $v$ . A degree r…