| 2008 |
|---|
| 14 | EE | Brian Alspach,
Danny Dyer,
Denis Hanson,
Boting Yang:
Time constrained graph searching.
Theor. Comput. Sci. 399(3): 158-168 (2008) |
| 2007 |
|---|
| 13 | EE | Brian Alspach,
Danny Dyer,
Denis Hanson,
Boting Yang:
Arc Searching Digraphs Without Jumping.
COCOA 2007: 354-365 |
| 12 | EE | Brian Alspach,
Danny Dyer,
Denis Hanson,
Boting Yang:
Lower Bounds on Edge Searching.
ESCAPE 2007: 516-527 |
| 2004 |
|---|
| 11 | EE | Denis Hanson,
John W. Moon:
Weakening arcs in tournaments.
Journal of Graph Theory 45(2): 142-162 (2004) |
| 2003 |
|---|
| 10 | | Ruth Haas,
Denis Hanson,
Gary MacGillivray:
Bounds For Partial List Colourings.
Ars Comb. 67: (2003) |
| 2002 |
|---|
| 9 | EE | Sheila Ferneyhough,
Ruth Haas,
Denis Hanson,
Gary MacGillivray:
Star forests, dominating sets and Ramsey-type problems.
Discrete Mathematics 245(1-3): 255-262 (2002) |
| 1998 |
|---|
| 8 | | Suqin Ao,
Denis Hanson:
Score Vectors and Tournaments with Cyclic Chromatic Number 1 or 2.
Ars Comb. 49: (1998) |
| 7 | | Denis Hanson,
C. O. M. Loten,
Bjarne Toft:
On interval colourings of bi-regular bipartite graphs.
Ars Comb. 50: (1998) |
| 1996 |
|---|
| 6 | | Denis Hanson,
Gary MacGillivray,
Bjarne Toft:
Choosability of bipartite graphs.
Ars Comb. 44: (1996) |
| 1993 |
|---|
| 5 | EE | Denis Hanson,
Gary MacGillivray,
Dale Youngs:
The size of a minimum five-chromatic K4-free graph.
Discrete Mathematics 122(1-3): 353-355 (1993) |
| 1992 |
|---|
| 4 | EE | Denis Hanson:
A quick proof that K10 != P + P + P.
Discrete Mathematics 101(1-3): 107-108 (1992) |
| 3 | EE | Denis Hanson,
Ping Wang,
Leif K. Jørgensen:
On cages with given degree sets.
Discrete Mathematics 101(1-3): 109-114 (1992) |
| 1972 |
|---|
| 2 | | H. L. Abbott,
Denis Hanson:
Lower Bounds for Certain Types of van der Waerden Numbers.
J. Comb. Theory, Ser. A 12(1): 143-146 (1972) |
| 1 | | H. L. Abbott,
Denis Hanson:
Intersection Theorems for Systems of Sets.
J. Comb. Theory, Ser. A 12(3): 381-389 (1972) |
