Karen Seyffarth

• Small cycle double covers of line graphs and small cycle double covers of products of graphs
• Upper bounds on domination numbers of certain classes of graphs
• Improving lower bounds on the maximum number of vertices in planar networks with given diameter and maximum degree

Journal Article

• Laflamme, Claude and Seyffarth, Karen. "Chromatic Distinguishing Number of Bipartite Graph". Elec. Journal of Combinatorics 16.1 (2009). Print.
• MacGillivray, G. and Seyffarth, Karen. "Bounds for the independent domination number of graphs and planar graphs". Journal of Combinatorial Mathematics and Combinatorial Computing 49. (2004): 33-55. Print.
• Lutscher, Frithjof, McNulty, Jenny, Morris, Joy and Seyffarth, Karen. "Stitching images back together". Congressus Numerantium. A Conference Journal on Numerical Themes 165. (2003): 161-168. Print.
• Fish, J. M., Klimmek, R. and Seyffarth, Karen. "Line graphs of complete multipartite graphs have small cycle double covers". Discrete Math. 257.1 (2002): 39-61. Print.
• MacGillivray, G. and Seyffarth, Karen. "Classes of line graphs with small cycle double covers". The Australasian Journal of Combinatorics 24. (2001): 91-114. Print.
• Hell, P. and Seyffarth, Karen. "Broadcasting in planar graphs". The Australasian Journal of Combinatorics 17. (1998): 309-318. Print.
• Fellows, M., Hell, P. and Seyffarth, Karen. "Constructions of large planar networks with given degree and diameter". Networks. An International Journal 32.4 (1998): 275-281. Print.
• MacGillivray, G. and Seyffarth, Karen. "Domination numbers of planar graphs". Journal of Graph Theory 22.3 (1996): 213-229. Print.
• Fellows, M., Hell, P. and Seyffarth, Karen. "Large planar graphs with given diameter and maximum degree". Discrete Applied Mathematics. Combinatorial Algorithms, Optimization and Computer Science 61.2 (1995): 133-153. Print.
• Seyffarth, Karen. "Packings and perfect path double covers of maximal planar graphs". Discrete Math. 117.1-3 (1993): 183-195. Print.
• Hell, P. and Seyffarth, Karen. "Largest planar graphs of diameter two and fixed maximum degree". Discrete Math. 111.1-3 (1993): 313-322. Print.
• Seyffarth, Karen. "Small cycle double covers of 4-connected planar graphs". Combinatorica. An International Journal on Combinatorics and the Theory of Computing 13.4 (1993). Print.
• Seyffarth, Karen. "Haj\'os' conjecture and small cycle double covers of planar graphs". Discrete Math. 101.1-3 (1992): 291-306. Print.
• Seyffarth, Karen. "Maximal planar graphs of diameter two". Journal of Graph Theory 13.5 (1989): 619-648. Print.
• Hanson, D. and Seyffarth, Karen. "Point saturation of graphs". Ars Combinatoria 20. (1985): 147-157. Print.
• Hanson, D. and Seyffarth, Karen. "k-saturated graphs of prescribed maximum degree". Congressus Numerantium. A Conference Journal on Numerical Themes 42. (1984). Print.