Degrees:
Ph.D., Clemson Univ.
M.S., Texas State Univ.
B.S., Univ. of Texas at Austin
Kirsti received her B.S. in Mathematics from the University of Texas at Austin and her Ph.D. in Mathematical Sciences from Clemson University. She was a Harold L. Dorwart Visiting Assistant Professor at Trinity College from 2014-2017 and an Assistant Professor of Mathematics at Western New England University from 2017-2019. Kirsti is enthusiastic about the opportunity to return to Trinity. Her research interests are in the fields of Graph Theory and Algebra. She believes that the language of mathematics is one of the most beautiful forms of communication for it is both universal and one that every individual will struggle with at some level. For this reason, she strives to create an interactive classroom filled with ample opportunity to practice.
|
-
Linear Algebra
-
Decision Making
-
Graph Theory
-
Abstract Algebra
-
Combinatorics
|
-
Graph Theory
-
Combinatorics
-
Algebraic Geometry
-
Discrete Optimization
|
- B. Bresar, K. Kuenzel, and D.F. Rall. Graphs with a unique maximum open packing, submitted (2019)
- K. Kuenzel and D.F. Rall. Well-covered direct products, submitted (2019)
- B. Bresar, B. Hartnell, M.A. Henning, D.F. Rall, and K. Wash. A new framework to approach Vizing's conjecture, submitted (2018)
- B.L. Hartnell, D.F. Rall, and K. Wash. On well-covered Cartesian products, Graphs and Combin., 34(6): 1259-1268 (2018)
- S.E. Anderson, S. Nagpal, and K. Wash. Domination in the hierarchical product and Vizing's conjecture, Discrete Math., 341(1): 20-24 (2018)
- B. Bresar, S. Klavzar, D.F. Rall, and K. Wash. Packing chromatic number versus chromatic and clique number, Aequat. Math., 92(3): 497-513 (2017)
- B. Bresar, S. Klavzar, D.F. Rall, and K. Wash. Packing chromatic number, (1,1,2,2)-colorings, and characterizing the Petersen graphs, Aequat. Math., 91(1): 169-184(2017)
- B. Bresar, S. Klavzar, D.F. Rall, and K. Wash. Packing chromatic number under local changes in a graph, Discrete Math., 340(5): 1110-1115 (2017)
- M. Henning and K. Wash. Matchings, path covers and domination, Discrete Math., 340(1): 3207-3216 (2017)
- D.F. Rall and K. Wash. On minimum identifying codes in some Cartesian product graphs, Graphs and Combin. 33(4): 1037-1053 (2017)
|
|