| 2004 |
|---|
| 11 | | André E. Kézdy,
Hunter S. Snevily:
Polynomials that Vanish on Distinct nth Roots of Unity.
Combinatorics, Probability & Computing 13(1): 37-59 (2004) |
| 2003 |
|---|
| 10 | EE | Hunter S. Snevily:
A Sharp Bound for the Number of Sets that Pairwise Intersect at k Positive Values.
Combinatorica 23(3): 527-533 (2003) |
| 2002 |
|---|
| 9 | | André E. Kézdy,
Hunter S. Snevily:
Distinct Sums Modulo N And Tree Embeddings.
Combinatorics, Probability & Computing 11(1): (2002) |
| 1999 |
|---|
| 8 | EE | Hunter S. Snevily:
A Generalization of Fisher's Inequality.
J. Comb. Theory, Ser. A 85(1): 120-125 (1999) |
| 1997 |
|---|
| 7 | EE | Hunter S. Snevily:
New families of graphs that have alpha-labelings.
Discrete Mathematics 170(1-3): 185-194 (1997) |
| 6 | EE | André E. Kézdy,
Hunter S. Snevily:
On Extensions of a Conjecture of Gallai.
J. Comb. Theory, Ser. B 70(2): 317-324 (1997) |
| 1996 |
|---|
| 5 | EE | André E. Kézdy,
Hunter S. Snevily,
Chi Wang:
Partitioning Permutations into Increasing and Decreasing Subsequences.
J. Comb. Theory, Ser. A 73(2): 353-359 (1996) |
| 1994 |
|---|
| 4 | EE | Hunter S. Snevily:
The snake-in-the-box problem: A new upper bound.
Discrete Mathematics 133(1-3): 307-314 (1994) |
| 3 | | D. A. Duffus,
Hal A. Kierstead,
Hunter S. Snevily:
An Explicit 1-Factorization in the Middle of the Boolean Lattice.
J. Comb. Theory, Ser. A 65(2): 334-342 (1994) |
| 2 | | Hunter S. Snevily:
On Generalizations of the deBruijn - Erdös Theorem.
J. Comb. Theory, Ser. A 68(1): 232-238 (1994) |
| 1992 |
|---|
| 1 | | Hunter S. Snevily:
A New Result on Chvátal's Conjecture.
J. Comb. Theory, Ser. A 61(1): 137-141 (1992) |
