S. Kingan

activity

20112024

most citedA decomposition theorem for binary matroids with no prism minor

8 citations · 11 across the 14 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

math.CO2021

On cyclically 4-connected cubic graphs

R. J. Kingan, S. R. Kingan

For $k \geq 4$ , let $Q_{2 k}$ and $V_{2 k}$ denote the ladder and Möbius ladder on $2 k$ vertices, respectively. We prove results that build on a result by Wormald that states that any…

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…