Gena Hahn

According to our database, Gena Hahn authored at least 33 papers between 1980 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

On cop-win dynamic graphs.

Gabriel Fortin-Leblanc, Gena Hahn, Frank Ramamonjisoa

Discret. Appl. Math., 2024

2021

Edge clique covers in graphs with independence number two.

Pierre Charbit, Gena Hahn, Marcin Kaminski, Manuel Lafond, Nicolas Lichiardopol, Reza Naserasr, Ben Seamone, Rezvan Sherkati

J. Graph Theory, 2021

2019

A lower bound on the size of an absorbing set in an arc-coloured tournament.

Laurent Beaudou, Luc Devroye, Gena Hahn

Discret. Math., 2019

2017

Cops and Robbers ordinals of cop-win trees.

Anthony Bonato, Przemyslaw Gordinowicz, Gena Hahn

Discret. Math., 2017

2012

Some results on the injective chromatic number of graphs.

Min Chen, Gena Hahn, André Raspaud, Weifan Wang

J. Comb. Optim., 2012

Lexicographic products with high reconstruction numbers.

Richard C. Brewster, Gena Hahn, Stacey Wynn Lamont, Chester Lipka

Discret. Math., 2012

2011

Preface.

Gena Hahn, Bojan Mohar

Discret. Math., 2011

2010

Large classes of infinite <i>k</i>-cop-win graphs.

Anthony Bonato, Gena Hahn, Claude Tardif

J. Graph Theory, 2010

Some bounds on the injective chromatic number of graphs.

Alain Doyon, Gena Hahn, André Raspaud

Discret. Math., 2010

2009

The capture time of a graph.

Anthony Bonato, Petr A. Golovach, Gena Hahn, Jan Kratochvíl

Discret. Math., 2009

Counting feasible solutions of the traveling salesman problem with pickups and deliveries is #P-complete.

Gerardo Berbeglia, Gena Hahn

Discret. Appl. Math., 2009

2007

The cop density of a graph.

Anthony Bonato, Gena Hahn, Changping Wang

Contributions Discret. Math., 2007

2006

A note on k-cop, l-robber games on graphs.

Gena Hahn, Gary MacGillivray

Discret. Math., 2006

2005

Preface.

Gena Hahn, Pierre Ille, Stéphan Thomassé

Discret. Math., 2005

2004

Absorbing sets in arc-coloured tournaments.

Gena Hahn, Pierre Ille, Robert E. Woodrow

Discret. Math., 2004

2002

On cop-win graphs.

Gena Hahn, François Laviolette, Norbert Sauer, Robert E. Woodrow

Discret. Math., 2002

On the injective chromatic number of graphs.

Gena Hahn, Jan Kratochvíl, Jozef Sirán, Dominique Sotteau

Discret. Math., 2002

2001

Cycle regular graphs need not be transitive.

Jean-Luc Fouquet, Gena Hahn

Discret. Appl. Math., 2001

1997

Edge-Ends in Countable Graphs.

Gena Hahn, François Laviolette, Jozef Sirán

J. Comb. Theory B, 1997

1995

On a Matrix Partition Conjecture.

Richard A. Brualdi, Gena Hahn, Peter Horák, Earl S. Kramer, Stephen Mellendorf, Dale M. Mesner

J. Comb. Theory A, 1995

On the ultimate independence ratio of a graph.

Gena Hahn, Pavol Hell, Svatopluk Poljak

Eur. J. Comb., 1995

Minimal graphs that fold onto K_n.

Guo-Gang Gao, Gena Hahn

Discret. Math., 1995

1994

Preface.

Achille Achache, Gena Hahn, Maurice Pouzet, Ivo G. Rosenberg

Discret. Math., 1994

1991

Infinite friendship graphs with infinite parameters.

Gena Hahn, Eric C. Milner, Robert E. Woodrow

J. Comb. Theory B, 1991

1990

A note concerning paths and independence number in digraphs.

Gena Hahn, Bill Jackson

Discret. Math., 1990

1989

Preface.

Gena Hahn, Ivo G. Rosenberg

Discret. Appl. Math., 1989

1986

Concerning the achromatic number of graphs.

Martin Farber, Gena Hahn, Pavol Hell, Donald J. Miller

J. Comb. Theory B, 1986

Path and cycle sub-ramsey numbers and an edge-colouring conjecture.

Gena Hahn, Carsten Thomassen

Discret. Math., 1986

1984

Infinite generalized friendship graphs.

Charles Delorme, Gena Hahn

Discret. Math., 1984

1983

Short cycles in mediate graphs.

Gena Hahn, Dominique Sotteau, H. Sun

Discret. Math., 1983

1981

The automorphism group of a product of hypergraphs.

Gena Hahn

J. Comb. Theory B, 1981

More star sub-ramsey numbers.

Gena Hahn

Discret. Math., 1981

1980

The Automorphism Group of the Wreath Product of Directed Graphs.

Gena Hahn

Eur. J. Comb., 1980