#### Filter Results:

- Full text PDF available (8)

#### Publication Year

1965

2017

- This year (1)
- Last 5 years (4)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Gary MacGillivray, Karen Seyffarth
- Journal of Graph Theory
- 1996

- Pavol Hell, Karen Seyffarth
- Discrete Mathematics
- 1993

- Michael R. Fellows, Pavol Hell, Karen Seyffarth
- Discrete Applied Mathematics
- 1995

- R. Haas, Karen Seyffarth
- Graphs and Combinatorics
- 2014

Given a graphG, the k-dominating graph ofG, Dk(G), is defined to be the graph whose vertices correspond to the dominating sets of G that have cardinality at most k. Two vertices in Dk(G) are adjacent if and only if the corresponding dominating sets of G differ by either adding or deleting a single vertex. The graph Dk(G) aids in studying the reconfiguration… (More)

- Subhendu Chattopadhyay, Lisa Higham, Karen Seyffarth
- PODC
- 2002

Finding a maximal or maximum matching in a graph is a well-understood problem for which efficient sequential algorithms exist. Applications of matchings in distributed settings make it desirable to find self-stabilizing asynchronous distributed solutions to these problems. We first present a self-stabilizing algorithm for finding a maximal matching in a… (More)

- Michael R. Fellows, Pavol Hell, Karen Seyffarth
- Networks
- 1998

Let H be a graph, and k ≥ χ(H) an integer. We say that H has a Gray code of k-colourings if and only if it is possible to list all its k-colourings in such a way that consecutive colourings (including the last and the first) agree on all vertices of H except one. The Gray code number of H is the least integer k0(H) such that H has a Gray code of its… (More)

- Karen Seyffarth
- Zentralblatt für Gynäkologie
- 1978

It was told about a pessary, with the help of which could be done an excellent therapy and prophylaxis of the threatening of a partus prämaturus imminens in cervixinsufficiency. To make use of it is very simple. With the help of this method one could lower the rate of miscarriages to 3,6% in comparison to a period without cerclage or pessary, when the rate… (More)

- Karen Seyffarth
- Journal of Graph Theory
- 1989

A maximal planar graph is a simple planar graph in which every face is a triangle. We show here that such graphs with maximum degree A and diameter two have no more than :A + 1 vertices. We also show that there exist maximal planar graphs with diameter two and exactly L i A + 1 J vertices. INTRODUCTION Our interest in maximal planar graphs, and in… (More)

- Richard J. Nowakowski, Karen Seyffarth
- Journal of Graph Theory
- 2008