| * | 2009 |
| 37 | EE | Jerrold R. Griggs,
Daniel Král:
Graph labellings with variable weights, a survey.
Discrete Applied Mathematics 157(12): 2646-2658 (2009) |
| 2008 |
| 36 | EE | Jerrold R. Griggs,
Gyula O. H. Katona:
No four subsets forming an N.
J. Comb. Theory, Ser. A 115(4): 677-685 (2008) |
| 35 | EE | Jerrold R. Griggs,
Xiaohua Teresa Jin:
Real Number Channel Assignments for Lattices.
SIAM J. Discrete Math. 22(3): 996-1021 (2008) |
| 2007 |
| 34 | EE | Jerrold R. Griggs,
Xiaohua Teresa Jin:
Recent progress in mathematics and engineering on optimal graph labellings with distance conditions.
J. Comb. Optim. 14(2-3): 249-257 (2007) |
| 2006 |
| 33 | EE | Jerrold R. Griggs,
Xiaohua Teresa Jin:
Real Number Graph Labellings with Distance Conditions.
SIAM J. Discrete Math. 20(2): 302-327 (2006) |
| 2005 |
| 32 | EE | Jerrold R. Griggs,
Xiaohua Teresa Jin:
Optimal Channel Assignments for Lattices with Conditions at Distance Two.
IPDPS 2005 |
| 2004 |
| 31 | EE | Jerrold R. Griggs,
Charles E. Killian,
Carla D. Savage:
Venn Diagrams and Symmetric Chain Decompositions in the Boolean Lattice.
Electr. J. Comb. 11(1): (2004) |
| 2002 |
| 30 | EE | Jerrold R. Griggs,
Chih-Chang Ho:
On the half?half case of the Zarankiewicz problem.
Discrete Mathematics 249(1-3): 95-104 (2002) |
| 29 | EE | Lenore Cowen,
Jerrold R. Griggs,
Douglas B. West:
Foreword.
Discrete Mathematics 257(2-3): 191-192 (2002) |
| 28 | EE | Richard P. Anstee,
Ron Ferguson,
Jerrold R. Griggs:
Permutations with Low Discrepancy Consecutive k-sums.
J. Comb. Theory, Ser. A 100(2): 302-321 (2002) |
| 2001 |
| 27 | EE | Jerrold R. Griggs:
Spanning subset sums for finite Abelian groups.
Discrete Mathematics 229(1-3): 89-99 (2001) |
| 1997 |
| 26 | EE | Jerrold R. Griggs,
Yan-Chyuan Lin:
The maximum sum of degrees above a threshold in planar graphs.
Discrete Mathematics 169(1-3): 233-243 (1997) |
| 25 | EE | Jerrold R. Griggs,
Jianxin Ouyang:
(0, 1)-Matrices with No Half-Half Submatrix of Ones.
Eur. J. Comb. 18(7): 751-761 (1997) |
| 1996 |
| 24 | EE | Jerrold R. Griggs,
Owen Murphy:
Edge density and independence ratio in triangle-free graphs with maximum degree three.
Discrete Mathematics 152(1-3): 157-170 (1996) |
| 23 | EE | Richard P. Anstee,
Jerrold R. Griggs:
An application of matching theory of edge-colourings.
Discrete Mathematics 156(1-3): 253-256 (1996) |
| 1995 |
| 22 | EE | Jerrold R. Griggs,
Yan-Chyuan Lin:
Planar graphs with few vertices of small degree.
Discrete Mathematics 143(1-3): 47-70 (1995) |
| 21 | EE | Jerrold R. Griggs:
Matchings, cutsets, and chain partitions in graded posets.
Discrete Mathematics 144(1-3): 33-46 (1995) |
| 1994 |
| 20 | EE | Jerrold R. Griggs,
Daniel J. Kleitman:
Independence and the Havel-Hakimi residue.
Discrete Mathematics 127(1-3): 209-212 (1994) |
| 19 | | Jerrold R. Griggs:
The Channel Assigment Problem for Mutually Adjacent Sites.
J. Comb. Theory, Ser. A 68(1): 169-183 (1994) |
| 1992 |
| 18 | EE | Jerrold R. Griggs,
Joan P. Hutchinson:
On the r-domination number of a graph.
Discrete Mathematics 101(1-3): 65-72 (1992) |
| 17 | EE | Jerrold R. Griggs,
Mingshen Wu:
Spanning trees in graphs of minimum degree 4 or 5.
Discrete Mathematics 104(2): 167-183 (1992) |
| 16 | | Jerrold R. Griggs,
Roger K. Yeh:
Labelling Graphs with a Condition at Distance 2.
SIAM J. Discrete Math. 5(4): 586-595 (1992) |
| 1991 |
| 15 | EE | Jerrold R. Griggs:
Iterated exponentials of two numbers.
Discrete Mathematics 88(2-3): 193-209 (1991) |
| 1990 |
| 14 | EE | Zoltán Füredi,
Jerrold R. Griggs,
Ron Holzman,
Daniel J. Kleitman:
Representations of families of triples over GF(2).
J. Comb. Theory, Ser. A 53(2): 306-315 (1990) |
| 1989 |
| 13 | EE | Jerrold R. Griggs,
James W. Walker:
Anticlusters and intersecting families of subsets.
J. Comb. Theory, Ser. A 51(1): 90-103 (1989) |
| 12 | | Zoltán Füredi,
Jerrold R. Griggs,
Daniel J. Kleitman:
Pair Labeelings with Given Distance.
SIAM J. Discrete Math. 2(4): 491-499 (1989) |
| 1988 |
| 11 | EE | Jerrold R. Griggs,
Charles M. Grinstead,
David R. Guichard:
The number of maximal independent sets in a connected graph.
Discrete Mathematics 68(2-3): 211-220 (1988) |
| 10 | EE | Jerrold R. Griggs:
Problems on chain partitions.
Discrete Mathematics 72(1-3): 157-162 (1988) |
| 9 | EE | Jerrold R. Griggs:
Saturated chains of subsets and a random walk.
J. Comb. Theory, Ser. A 47(2): 262-283 (1988) |
| 1987 |
| 8 | EE | Zoltán Füredi,
Jerrold R. Griggs,
Andrew M. Odlyzko,
James B. Shearer:
Ramsey-Sperner theory.
Discrete Mathematics 63(2-3): 143-152 (1987) |
| 1986 |
| 7 | | Zoltán Füredi,
Jerrold R. Griggs:
Families of finite sets with minimum shadows.
Combinatorica 6(4): 355-363 (1986) |
| 6 | EE | Jerrold R. Griggs,
Andrew M. Odlyzko,
James B. Shearer:
k-Color Sperner theorems.
J. Comb. Theory, Ser. A 42(1): 31-54 (1986) |
| 1984 |
| 5 | | Jerrold R. Griggs,
Jürgen Stahl,
William T. Trotter:
A Sperner Theorem on Unrelated Chains of Subsets.
J. Comb. Theory, Ser. A 36(1): 124-127 (1984) |
| 1983 |
| 4 | | Jerrold R. Griggs:
An Upper Bound on the Ramsey Numbers R(3, k).
J. Comb. Theory, Ser. A 35(2): 145-153 (1983) |
| 3 | EE | Jerrold R. Griggs:
Lower bounds on the independence number in terms of the degrees.
J. Comb. Theory, Ser. B 34(1): 22-39 (1983) |
| 1980 |
| 2 | | Jerrold R. Griggs:
On Chains and Sperner k-Families in Ranked Posets.
J. Comb. Theory, Ser. A 28(2): 156-168 (1980) |
| 1 | | Jerrold R. Griggs:
On Chains and Sperner k-Families in Ranked Posets, II.
J. Comb. Theory, Ser. A 29(3): 391-394 (1980) |