default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKaren Seyffarth
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j22]Kira V. Adaricheva, Heather C. Smith Blake
, Chassidy Bozeman, Nancy E. Clarke, Ruth Haas, Margaret-Ellen Messinger, Karen Seyffarth:
Hamilton Paths in Dominating Graphs of Trees and Cycles. Graphs Comb. 38(6): 174 (2022)
2010 – 2019
- 2019
- [j21]Michael S. Cavers, Karen Seyffarth:
Reconfiguring vertex colourings of 2-trees. Ars Math. Contemp. 17(2): 653-698 (2019) - 2018
- [j20]T. K. Rapke, Karen Seyffarth:
On nice and injective-nice tournaments. Discret. Math. 341(1): 1-19 (2018) - [j19]Michael S. Cavers, Karen Seyffarth, Ethan P. White:
Distinguishing chromatic numbers of complements of Cartesian products of complete graphs. Discret. Math. 341(9): 2431-2441 (2018) - 2017
- [j18]Ruth Haas, Karen Seyffarth:
Reconfiguring dominating sets in some well-covered and other classes of graphs. Discret. Math. 340(8): 1802-1817 (2017) - 2014
- [j17]Ruth Haas, Karen Seyffarth:
The k-Dominating Graph. Graphs Comb. 30(3): 609-617 (2014) - 2013
- [j16]Michael S. Cavers, Karen Seyffarth:
Graphs with Large Distinguishing Chromatic Number. Electron. J. Comb. 20(1): 19 (2013)
2000 – 2009
- 2009
- [j15]Claude Laflamme, Karen Seyffarth:
Distinguishing Chromatic Numbers of Bipartite Graphs. Electron. J. Comb. 16(1) (2009) - [j14]Richard J. Nowakowski, Karen Seyffarth:
Small Cycle Double Covers of Products II: Categorical and Strong Products with Paths and Cycles. Graphs Comb. 25(3): 385-400 (2009) - 2008
- [j13]Richard J. Nowakowski, Karen Seyffarth:
Small cycle double covers of products I: Lexicographic product with paths and cycles. J. Graph Theory 57(2): 99-123 (2008) - 2005
- [j12]Karen Seyffarth, Chengde Wang:
On eulerian and regular perfect path double covers of graphs. Discret. Math. 293(1-3): 237-250 (2005) - 2002
- [j11]J. M. Fish, Regina Klimmek, Karen Seyffarth:
Line graphs of complete multipartite graphs have small cycle double covers. Discret. Math. 257(1): 39-61 (2002) - [c1]Subhendu Chattopadhyay, Lisa Higham, Karen Seyffarth:
Dynamic and self-stabilizing distributed matching. PODC 2002: 290-297 - 2001
- [j10]Gary MacGillivray, Karen Seyffarth:
Classes of line graphs with small cycle double covers. Australas. J Comb. 24: 91-114 (2001)
1990 – 1999
- 1998
- [j9]Pavol Hell, Karen Seyffarth:
Broadcasting in planar graphs. Australas. J Comb. 17: 309- (1998) - [j8]Michael R. Fellows, Pavol Hell, Karen Seyffarth:
Constructions of large planar networks with given degree and diameter. Networks 32(4): 275-281 (1998) - 1996
- [j7]Gary MacGillivray, Karen Seyffarth:
Domination numbers of planar graphs. J. Graph Theory 22(3): 213-229 (1996) - 1995
- [j6]Michael R. Fellows, Pavol Hell, Karen Seyffarth:
Large Planar Graphs with Given Diameter and Maximum Degree. Discret. Appl. Math. 61(2): 133-153 (1995) - 1993
- [j5]Karen Seyffarth:
Small cycle double covers of 4-connected planer. Comb. 13(4): 477-482 (1993) - [j4]Pavol Hell, Karen Seyffarth:
Largest planar graphs of diameter two and fixed maximum degree. Discret. Math. 111(1-3): 313-322 (1993) - [j3]Karen Seyffarth:
Packings and perfect path double covers of maximal planar graphs. Discret. Math. 117(1-3): 183-195 (1993) - 1992
- [j2]Karen Seyffarth:
Hajós' conjecture and small cycle double covers of planar graphs. Discret. Math. 101(1-3): 291-306 (1992)
1980 – 1989
- 1989
- [j1]Karen Seyffarth:
Maximal planar graphs of diameter two. J. Graph Theory 13(5): 619-648 (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
