Toughness of Generalized Petersen Graphs. - Kevin Ferland (Ars Comb., 2003)

Totally magic labelings of graphs. - William C. Calhoun; Kevin Ferland; Lisa Lister; John B. Polhill (Australas. J Comb., 2005)

Supertough graphs need not be K1, 3-free. - Lynne L. Doty; Kevin K. Ferland (Australas. J Comb., 2005)

The tough sets for the generalized Petersen graphs G(n, 2). - Kevin K. Ferland; Megan L. Holben (Australas. J Comb., 2006)

Some Maximally Tough Circulants. - Lynne L. Doty; Kevin Ferland (Ars Comb., 2008)

Constructing a large class of supertough graphs. - Lynne L. Doty; Kevin K. Ferland (Australas. J Comb., 2009)

Record Crossword Puzzles. - Kevin K. Ferland (Am. Math. Mon., 2014)