On Conflict-Avoiding Codes of Length n=4m for Three Active Users. - Masakazu Jimbo; Miwako Mishima; Susan Janiszewski; Amin Y. Teymorian; Vladimir D. Tonchev (IEEE Trans. Inf. Theory, 2007)

3-Connected {K 1, 3, P 9}-Free Graphs are Hamiltonian-Connected. - Qiuju Bian; Ronald J. Gould; Paul Horn; Susan Janiszewski; Steve La Fleur; Paul Wrayno (Graphs Comb., 2014)