 | 2012 |
| 24 |  | Richard C. Brewster,
Gena Hahn,
Stacey Wynn Lamont,
Chester Lipka:
Lexicographic products with high reconstruction numbers.
Discrete Mathematics 312(10): 1638-1645 (2012) |
| 2011 |
| 23 |  | Gena Hahn,
Bojan Mohar:
Preface.
Discrete Mathematics 311(15): 1389 (2011) |
| 2010 |
| 22 |  | Alain Doyon,
Gena Hahn,
André Raspaud:
Some bounds on the injective chromatic number of graphs.
Discrete Mathematics 310(3): 585-590 (2010) |
| 21 |  | Anthony Bonato,
Gena Hahn,
Claude Tardif:
Large classes of infinite k-cop-win graphs.
Journal of Graph Theory 65(4): 334-342 (2010) |
| 2009 |
| 20 |  | Gerardo Berbeglia,
Gena Hahn:
Counting feasible solutions of the traveling salesman problem with pickups and deliveries is #P-complete.
Discrete Applied Mathematics 157(11): 2541-2547 (2009) |
| 19 |  | Anthony Bonato,
Petr A. Golovach,
Gena Hahn,
Jan Kratochvíl:
The capture time of a graph.
Discrete Mathematics 309(18): 5588-5595 (2009) |
| 2006 |
| 18 |  | Gena Hahn,
Gary MacGillivray:
A note on k-cop, l-robber games on graphs.
Discrete Mathematics 306(19-20): 2492-2497 (2006) |
| 2005 |
| 17 |  | Gena Hahn,
Pierre Ille,
Stéphan Thomassé:
Preface.
Discrete Mathematics 291(1-3): 1- (2005) |
| 2004 |
| 16 |  | Gena Hahn,
Pierre Ille,
Robert E. Woodrow:
Absorbing sets in arc-coloured tournaments.
Discrete Mathematics 283(1-3): 93-99 (2004) |
| 2002 |
| 15 |  | Gena Hahn,
Jan Kratochvíl,
Jozef Sirán,
Dominique Sotteau:
On the injective chromatic number of graphs.
Discrete Mathematics 256(1-2): 179-192 (2002) |
| 14 |  | Gena Hahn,
François Laviolette,
Norbert Sauer,
Robert E. Woodrow:
On cop-win graphs.
Discrete Mathematics 258(1-3): 27-41 (2002) |
| 2001 |
| 13 |  | Jean-Luc Fouquet,
Gena Hahn:
Cycle regular graphs need not be transitive.
Discrete Applied Mathematics 113(2-3): 261-264 (2001) |
| 1997 |
| 12 |  | Gena Hahn,
François Laviolette,
Jozef Sirán:
Edge-Ends in Countable Graphs.
J. Comb. Theory, Ser. B 70(2): 225-244 (1997) |
| 1995 |
| 11 |  | Guo-Gang Gao,
Gena Hahn:
Minimal graphs that fold onto Kn.
Discrete Mathematics 142(1-3): 277-280 (1995) |
| 10 |  | Richard A. Brualdi,
Gena Hahn,
Peter Horák,
Earl S. Kramer,
Stephen Mellendorf,
Dale M. Mesner:
On a Matrix Partition Conjecture.
J. Comb. Theory, Ser. A 69(2): 333-346 (1995) |
| 1991 |
| 9 |  | Gena Hahn,
Eric C. Milner,
Robert E. Woodrow:
Infinite friendship graphs with infinite parameters.
J. Comb. Theory, Ser. B 52(1): 30-41 (1991) |
| 1990 |
| 8 |  | Gena Hahn,
Bill Jackson:
A note concerning paths and independence number in digraphs.
Discrete Mathematics 82(3): 327-329 (1990) |
| 1989 |
| 7 |  | Gena Hahn,
Ivo G. Rosenberg:
Preface.
Discrete Applied Mathematics 24(1-3): 1-2 (1989) |
| 1986 |
| 6 |  | Gena Hahn,
Carsten Thomassen:
Path and cycle sub-ramsey numbers and an edge-colouring conjecture.
Discrete Mathematics 62(1): 29-33 (1986) |
| 5 |  | Martin Farber,
Gena Hahn,
Pavol Hell,
Donald J. Miller:
Concerning the achromatic number of graphs.
J. Comb. Theory, Ser. B 40(1): 21-39 (1986) |
| 1984 |
| 4 |  | Charles Delorme,
Gena Hahn:
Infinite generalized friendship graphs.
Discrete Mathematics 49(3): 261-266 (1984) |
| 1983 |
| 3 |  | Gena Hahn,
Dominique Sotteau,
H. Sun:
Short cycles in mediate graphs.
Discrete Mathematics 44(3): 281-284 (1983) |
| 1981 |
| 2 |  | Gena Hahn:
More star sub-ramsey numbers.
Discrete Mathematics 34(2): 131-139 (1981) |
| 1 |  | Gena Hahn:
The automorphism group of a product of hypergraphs.
J. Comb. Theory, Ser. B 30(3): 276-281 (1981) |