View of Manhattan from Brooklyn Heights Home Page

  1. S. R. Kingan (submitted) Minor preserving deletable edges in graphs

  2. S. R. Kingan (submitted) On P9*-free matroids

  3. S. R. Kingan (to appear) Quasiregular matroids, Electronic Journal of Combinatorics

  4. S. R. Kingan (to appear) A short proof of binary matroids with no 4-wheel minor, Australasian Journal of Combinatorics

  5. S. R. Kingan (2015) On Seymour's Decomposition Theorem. Annals of Combinatorics, 19, 171185.

  6. 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.

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

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

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

  10. S. R. Kingan and M. Lemos (2012), Matroids with at least two regular elements, European Journal of Combinatorics 33 10221029.

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

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

  13. 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.

  14. 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.

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

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

  17. 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.

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

  19. 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.

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

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

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

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

  24. 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.

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