Karen Seyffarth

Learn More
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)
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)
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)
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)