Books

1. Graphs and Networks (2022) by S. R. Kingan and published by Wiley, Inc. This book is available on Amazon.

2. Research Trends in Graph Theory (2021), AWM Springer Series on Graph Theory and Applications. (Editors: Daniela Fererra, Leslie Hogben, Sandra Kingan and Gretchen Matthews) SpringerNature. This book is also available on Amazon.

Peer Reviewed Research Papers

1. S. T. Adams and S. R. Kingan (submitted). Pancyclicity of almost-planar graphs (arXiv: 2410.21239)

2. S. R. Kingan (submitted). Deletable edges in minimally 3-connected graphs (arXiv: 1802.02660v3)

3. R. J. Kingan and S. R. Kingan (submitted).  Characterizing minimally 3-connected graphs.

4. V. Cherniavskyi,  G. Dennis, and S. R. Kingan (2025). On the epidemic threshold of a network, Involve, a Journal of Mathematics 18-2, 283--296. 

5. R. J. Kingan and S. R. Kingan (2024). On cyclically 4-connected cubic graphs, AKCE International Journal of Graphs and Combinatorics, 1–7. 

6. S. R. Kingan (2021) Finding monarchs in excluded minor classes of matroids, Australasian Journal of Mathematics, 79(3), 302–326.

7. K. Benson, J. Bolkema, K. Haymaker, C. Kelley, S. R. Kingan, G. Matthews, E. Nastase (2021). Analysis of Termatiko sets in measurement matrices, in Research Trends in Graph Theory, eds. D. Ferrero, L. Hogben, S. R. Kingan, G. Matthews, 51 – 72.

8. J. Costalonga and S. R. Kingan (2021). H-Critical Matroids, Graphs and Combinatorics 37, 797–803.

9. J. Costalonga, R. J. Kingan, S. R. Kingan (2021). Constructing minimally 3-connected graphs. Algorithms 14, no. 1: 9. (arXiv: 2012.12059  )

10. N. Benakli, E, Halleck, and S. R. Kingan (2019). A characterization of 2-neighborhood degree list of diameter 2 graphs, Congressus Numeratium, Vol 234, 39-46.

11. S. R. Kingan (2018). Quasiregular matroids, Electronic Journal of Combinatorics Vol. 25 – 3.

12. S. R. Kingan (2018). A short proof of binary matroids with no 4-wheel minor, Australasian Journal of Combinatorics Vol. 72(2), 201-205.

13. S. R. Kingan (2015). On Seymour's Decomposition Theorem. Annals of Combinatorics, 19, 171–185.

14. S. R. Kingan and M. Lemos (2014). A decomposition theorem for binary matroids with no prism minor, Graphs and Combinatorics , Vol. 30, Issue 6, 1479-1497.

15. S. R. Kingan and M. Lemos (2014), Strong Splitter Theorem,  Annals of Combinatorics, Vol. 18 – 1, 111 – 116.

16. S. R. Kingan (2013). Unlabeled Inequivalence in representable matroids, Proceedings of the SIAM Meeting on Analytic Algorithmics & Combinatorics, New Orleans, LA, Jan 6, 2013.

17. S. R. Kingan and M. Lemos (2012), Matroids with at least two regular elements, European Journal of Combinatorics 33 1022–1029.

18. S. R. Kingan and M. Lemos (2012), Two classification problems in matroid theory, (invited survey paper) Graph Theory Notes of New York LXIII, 17–27.

19. S. R. Kingan (2011), Stabilizers for GF(5)-representable matroids, Australasian Journal of Combinatorics, Vol. 49, 203-207.

20. S. R. Kingan (2011), Restrictions as Stabilizers, Advances in Applied Mathematics, 47, 194 - 197.

21. S. R. Kingan (2009), A computational approach to inequivalence in matroids, Proceedings of the Thirty-Seventh Southeastern International Conference on Combinatorics, Graph Theory and Computing. Congr. Numer. 198, 63-74.

22. A. Betten, R. J. Kingan, S. R. Kingan (2007), A note on GF(5)-representable matroids, Match: Communications in Mathematical and Computer Chemistry, Vol 58, 2, 511-521.

23. S. R. Kingan and M. Lemos (2006), On the circuit-cocircuit intersection conjecture, Graphs and Combinatorics, 22, 1 - 10.

24. S. R. Kingan and M. Lemos (2005), An excluded-minor problem in matroids, Annals of Combinatorics, 9, 199-204.

25. R. J. Kingan and S. R. Kingan (2005), A software system for matroids, Graphs and Discovery, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 287 - 296.

26. S. R. Kingan (2003). Matroids from a graph theory perspective, (invited survey paper) Graph Theory Notes of New York XLV, 21-35, New York Academy of Sciences.

27. R. J. Kingan, S. R. Kingan, and Wendy Myrvold (2003), On matroid generation, Congressus Numerantium 164, 95-109.

28. S. R. Kingan and M. Lemos (2002). Almost-graphic matroids, Advances in Applied Mathematics, 28, 438 - 477.

29. S. R. Kingan (1999). Intersections of circuits and cocircuits in binary matroids, Discrete Mathematics, 195, 157-165.

30. S. R. Kingan (1997). A generalization of a graph result by D. W. Hall, Discrete Mathematics 173, 129-135.

31. S. R. Kingan and J. G. Oxley (1996). On matroids in which all hyperplanes are binary, Discrete Mathematics, 160, 265-271.

32. S. R. Kingan (1996). On binary matroids with a K3,3 - minor, Matroid Theory: Proceedings of the 1995 AMS-IMS-SIAM Joint Summer Research Conference (eds. Bonin, J., Oxley, J. G. and Servatius, B), 363-369.

33. S. R. Kingan (1996). Binary matroids without prisms, prism duals and cubes, Discrete Mathematics, 152, 211-224.

Teaching and Math Culture Publications

1. S. R. Kingan (2022). Review of Mind and Matter: A Life in Math and Football in the March April 2022 Newsletter of the Association of Women in Mathematics,12 – 14.

2. S. R. Kingan (2021) On tracking in middle school, The Mathematical Association of America's Math Values Blog.

3. S. R. Kingan (2013) Connecting algebra to real-world issues, in Rethinking Mathematics, 2nd Edition, Editors Eric Gutstein and Bob Peterson, Rethinking Schools, p. 238 - 242.