Maximal planar graphs of diameter two. - Karen Seyffarth (J. Graph Theory, 1989)

Hajós' conjecture and small cycle double covers of planar graphs. - Karen Seyffarth (Discret. Math., 1992)

Small cycle double covers of 4-connected planer. - Karen Seyffarth (Comb., 1993)

Largest planar graphs of diameter two and fixed maximum degree. - Pavol Hell; Karen Seyffarth (Discret. Math., 1993)

Packings and perfect path double covers of maximal planar graphs. - Karen Seyffarth (Discret. Math., 1993)

Large Planar Graphs with Given Diameter and Maximum Degree. - Michael R. Fellows; Pavol Hell; Karen Seyffarth (Discret. Appl. Math., 1995)

Domination numbers of planar graphs. - Gary MacGillivray; Karen Seyffarth (J. Graph Theory, 1996)

Broadcasting in planar graphs. - Pavol Hell; Karen Seyffarth (Australas. J Comb., 1998)

Constructions of large planar networks with given degree and diameter. - Michael R. Fellows; Pavol Hell; Karen Seyffarth (Networks, 1998)

Classes of line graphs with small cycle double covers. - Gary MacGillivray; Karen Seyffarth (Australas. J Comb., 2001)

Dynamic and self-stabilizing distributed matching. - Subhendu Chattopadhyay; Lisa Higham; Karen Seyffarth (PODC, 2002)

Line graphs of complete multipartite graphs have small cycle double covers. - J. M. Fish; Regina Klimmek; Karen Seyffarth (Discret. Math., 2002)

On eulerian and regular perfect path double covers of graphs. - Karen Seyffarth; Chengde Wang (Discret. Math., 2005)

Small cycle double covers of products I: Lexicographic product with paths and cycles. - Richard J. Nowakowski; Karen Seyffarth (J. Graph Theory, 2008)

Distinguishing Chromatic Numbers of Bipartite Graphs. - Claude Laflamme; Karen Seyffarth (Electron. J. Comb., 2009)

Small Cycle Double Covers of Products II: Categorical and Strong Products with Paths and Cycles. - Richard J. Nowakowski; Karen Seyffarth (Graphs Comb., 2009)

Graphs with Large Distinguishing Chromatic Number. - Michael S. Cavers; Karen Seyffarth (Electron. J. Comb., 2013)

The k-Dominating Graph. - Ruth Haas; Karen Seyffarth (Graphs Comb., 2014)

Reconfiguring dominating sets in some well-covered and other classes of graphs. - Ruth Haas; Karen Seyffarth (Discret. Math., 2017)

Distinguishing chromatic numbers of complements of Cartesian products of complete graphs. - Michael S. Cavers; Karen Seyffarth; Ethan Patrick White (Discret. Math., 2018)

On nice and injective-nice tournaments. - T. K. Rapke; Karen Seyffarth (Discret. Math., 2018)

Reconfiguring vertex colourings of 2-trees. - Michael S. Cavers; Karen Seyffarth (Ars Math. Contemp., 2019)

Hamilton Paths in Dominating Graphs of Trees and Cycles. - Kira V. Adaricheva; Heather C. Smith Blake; Chassidy Bozeman; Nancy E. Clarke; Ruth Haas; Margaret-Ellen Messinger; Karen Seyffarth (Graphs Comb., 2022)