1. B. Bresar, K. Kuenzel, and D.F. Rall. Graphs with a unique maximum open packing, submitted (2019)
  2. K. Kuenzel and D.F. Rall. Well-covered direct products, submitted (2019)
  3. B. Brešar, B. Hartnell, M.A. Henning, D.F. Rall, and K. Wash. A new framework to approach Vizing’s conjecture, submitted (2018)
  4. B. Hartnell, D.F. Rall, and K. Wash. On well-covered Cartesian products, Graphs and Combin., accepted (2018)
  5. S.E. Anderson, S. Nagpal, and K. Wash. Domination in the hierarchical product and Vizing’s conjectureDiscrete Math., 341(1): 20-24 (2018)
  6. B. Brešar, S. Klavžar, D.F. Rall, and K. Wash. Packing chromatic number versus chromatic and clique number,  Aequat. Math.92(3): 497-513 (2017)
  7. B. Brešar, S. Klavžar, 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)
  8. B. Brešar, S. Klavžar, D.F. Rall, and K. Wash. Packing chromatic number under local changes in a graphDiscrete Math., 340(5): 1110-1115 (2017)
  9. M.A. Henning and K. Wash. Matchings, path covers and domination, Discrete Math., 340(1): 3207-3216 (2017)
  10.  D.F. Rall and K. Wash. On minimum identifying codes in some Cartesian product graphsGraphs and Combin.33(4): 1037-1053 (2017)
  11. J.P Georges, D. Mauro, and K. Wash. On zero-sum Z_{2j}^k-magic graphsJ. Combin. Optim. 34(1): 94-113 (2017)
  12. S.E. Anderson, Y. Guo, A. Tenney, and K. Wash. Prime factorization and domination in the generalized hierarchical productDiscuss. Math. Graph Theory, 37(4): 873-890 (2017)
  13. P.S. Skardal and K. Wash. Spectral properties of the hierarchical product of graphsPhysical Review E  94, 052311 (2016)
  14. M.A. Henning and K. Wash. Trees with large neighborhood total domination numberDiscrete Applied Math., 187: 96-102 (2015)
  15. W. Goddard, K. Wash, and H. Xu. WORM coloringsDiscuss. Math. Graph Theory, 35: 571-584 (2015)
  16. W. Goddard, K. Wash, and H. Xu. WORM colorings forbidding cycles or cliquesCongressus Numerantium, (2014)
  17. K. Wash. Edgeless graphs are the only universal fixersCzech. Math., 64(139): 833-843 (2014)
  18. D.F. Rall and K. Wash. Identifying codes of the direct product of two cliquesEuropean J. of Combin., 36: 159-171 (2014)
  19. W. Goddard and K. Wash. ID codes in Cartesian products of cliquesJ. Combin. Math. Combin. Comput., 85: 97-106 (2013)
  20. W. Gu and K. Wash. Bounds on the domination number of permutation graphsJ. Interconnection Networks, 10(3): 205-217 (2009)