A graph G is well-covered if every maximal independent set has the same cardinality q. Let ik(G) denote the number of independent sets of cardinality k in G. Brown, Dilcher, and Nowakowskiâ€¦ (More)

We prove that every finite subset of the plane is reconstructible from the multiset of its subsets of at most 18 points, each given up to rigid motion. We also give some results concerning theâ€¦ (More)

The study of Euler circuits of directed graphs related to DNA sequencing [1] inspired Arratia, BollobÃ¡s and Sorkin [2] to introduce a new graph polynomial satisfying a striking recurrence relation.â€¦ (More)