Karen Seyffarth - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 23 from 23

2022

Hamilton Paths in Dominating Graphs of Trees and CyclesKira V. Adaricheva, Heather C. Smith Blake, Chassidy Bozeman, Nancy E. Clarke, Ruth Haas, Margaret-Ellen Messinger, Karen Seyffarth. gc, 38(6):174, 2022. [doi]

2019

Reconfiguring vertex colourings of 2-treesMichael S. Cavers, Karen Seyffarth. arsmc, 17(2):653-698, 2019. [doi]

2018

Distinguishing chromatic numbers of complements of Cartesian products of complete graphsMichael S. Cavers, Karen Seyffarth, E. P. White. DM, 341(9):2431-2441, 2018. [doi]

On nice and injective-nice tournamentsT. K. Rapke, Karen Seyffarth. DM, 341(1):1-19, 2018. [doi]

2017

Reconfiguring dominating sets in some well-covered and other classes of graphsR. Haas, Karen Seyffarth. DM, 340(8):1802-1817, 2017. [doi]

2014

The k-Dominating GraphR. Haas, Karen Seyffarth. gc, 30(3):609-617, 2014. [doi]

2013

Graphs with Large Distinguishing Chromatic NumberMichael Cavers, Karen Seyffarth. combinatorics, 20(1):19, 2013. [doi]

2009

Distinguishing Chromatic Numbers of Bipartite GraphsClaude Laflamme, Karen Seyffarth. combinatorics, 16(1), 2009. [doi]

Small Cycle Double Covers of Products II: Categorical and Strong Products with Paths and CyclesRichard J. Nowakowski, Karen Seyffarth. gc, 25(3):385-400, 2009. [doi]

2008

Small cycle double covers of products I: Lexicographic product with paths and cyclesRichard J. Nowakowski, Karen Seyffarth. jgt, 57(2):99-123, 2008. [doi]

2005

On eulerian and regular perfect path double covers of graphsKaren Seyffarth, ChengDe Wang. DM, 293(1-3):237-250, 2005. [doi]

2002

Dynamic and self-stabilizing distributed matchingSubhendu Chattopadhyay, Lisa Higham, Karen Seyffarth. podc 2002: 290-297 [doi]

Line graphs of complete multipartite graphs have small cycle double coversJ. M. Fish, Regina Klimmek, Karen Seyffarth. DM, 257(1):39-61, 2002. [doi]

2001

Classes of line graphs with small cycle double coversGary MacGillivray, Karen Seyffarth. ajc, 24:91-114, 2001. [doi]

1998

Constructions of large planar networks with given degree and diameterMichael R. Fellows, Pavol Hell, Karen Seyffarth. networks, 32(4):275-281, 1998. [doi]

Broadcasting in planar graphsPavol Hell, Karen Seyffarth. ajc, 17:309, 1998. [doi]

1996

Domination numbers of planar graphsGary MacGillivray, Karen Seyffarth. jgt, 22(3):213-229, 1996. [doi]

1995

Large Planar Graphs with Given Diameter and Maximum DegreeMichael R. Fellows, Pavol Hell, Karen Seyffarth. DAM, 61(2):133-153, 1995. [doi]

1993

Largest planar graphs of diameter two and fixed maximum degreePavol Hell, Karen Seyffarth. DM, 111(1-3):313-322, 1993. [doi]

Packings and perfect path double covers of maximal planar graphsKaren Seyffarth. DM, 117(1-3):183-195, 1993. [doi]

Small cycle double covers of 4-connected planerKaren Seyffarth. combinatorica, 13(4):477-482, 1993.

1992

Hajós conjecture and small cycle double covers of planar graphsKaren Seyffarth. DM, 101(1-3):291-306, 1992. [doi]

1989

Maximal planar graphs of diameter twoKaren Seyffarth. jgt, 13(5):619-648, 1989. [doi]

Sign in or sign up to see more results.

runs on WebDSL