2009 |
14 | EE | Sebastian M. Cioaba,
David A. Gregory,
Willem H. Haemers:
Matchings in regular graphs from eigenvalues.
J. Comb. Theory, Ser. B 99(2): 287-297 (2009) |
2008 |
13 | EE | Michael S. Cavers,
Randall J. Elzinga,
David A. Gregory,
Sarah E. Vanderlinde,
Kevin N. Vander Meulen:
Clique partitions of distance multigraphs.
Discrete Mathematics 308(15): 3230-3240 (2008) |
2007 |
12 | EE | Sebastian M. Cioaba,
David A. Gregory,
Vladimir Nikiforov:
Extreme eigenvalues of nonregular graphs.
J. Comb. Theory, Ser. B 97(3): 483-486 (2007) |
2004 |
11 | EE | Randall J. Elzinga,
David A. Gregory,
Kevin N. Vander Meulen:
Addressing the Petersen graph.
Discrete Mathematics 286(3): 241-244 (2004) |
2003 |
10 | EE | David A. Gregory,
Brenda Heyink,
Kevin N. Vander Meulen:
Inertia and biclique decompositions of joins of graphs.
J. Comb. Theory, Ser. B 88(1): 135-151 (2003) |
2002 |
9 | EE | Randall J. Elzinga,
David A. Gregory,
Kevin N. Vander Meulen:
Addressing the Petersen graph.
Electronic Notes in Discrete Mathematics 11: 278-283 (2002) |
2001 |
8 | | Jian Shen,
David A. Gregory:
On the Girth of Digraphs with High Connectivity.
Ars Comb. 60: (2001) |
2000 |
7 | EE | Jian Shen,
David A. Gregory:
Exponents of vertex-transitive digraphs.
Discrete Mathematics 212(3): 245-255 (2000) |
1998 |
6 | EE | David A. Gregory,
Kevin N. Vander Meulen:
Decompositions of Complete Multigraphs Related to Hadamard Matrices.
J. Comb. Theory, Ser. A 82(2): 158-167 (1998) |
1995 |
5 | EE | Fahir Ö. Ergincan,
David A. Gregory:
Directed Moore Hypergraphs.
Discrete Applied Mathematics 63(2): 117-127 (1995) |
1991 |
4 | EE | David A. Gregory,
Norman J. Pullman,
Kathryn F. Jones,
J. Richard Lundgren:
Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices.
J. Comb. Theory, Ser. B 51(1): 73-89 (1991) |
1988 |
3 | EE | Dominique de Caen,
David A. Gregory:
Factorizations of symmetric designs.
J. Comb. Theory, Ser. A 49(2): 323-337 (1988) |
1986 |
2 | EE | David A. Gregory,
S. McGuinness,
W. Wallis:
Clique partitions of the cocktail party graph.
Discrete Mathematics 59(3): 267-273 (1986) |
1982 |
1 | EE | David A. Gregory,
Norman J. Pullman:
On a clique covering problem of orlin.
Discrete Mathematics 41(1): 97-99 (1982) |