Gena Hahn

According to our database1, Gena Hahn authored at least 32 papers between 1980 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Edge clique covers in graphs with independence number two.
J. Graph Theory, 2021

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

2017
Cops and Robbers ordinals of cop-win trees.
Discret. Math., 2017

2012
Some results on the injective chromatic number of graphs.
J. Comb. Optim., 2012

Lexicographic products with high reconstruction numbers.
Discret. Math., 2012

2011
Preface.
Discret. Math., 2011

2010
Large classes of infinite <i>k</i>-cop-win graphs.
J. Graph Theory, 2010

Some bounds on the injective chromatic number of graphs.
Discret. Math., 2010

2009
The capture time of a graph.
Discret. Math., 2009

Counting feasible solutions of the traveling salesman problem with pickups and deliveries is #P-complete.
Discret. Appl. Math., 2009

2007
The cop density of a graph.
Contributions Discret. Math., 2007

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

2005
Preface.
Discret. Math., 2005

2004
Absorbing sets in arc-coloured tournaments.
Discret. Math., 2004

2002
On cop-win graphs.
Discret. Math., 2002

On the injective chromatic number of graphs.
Discret. Math., 2002

2001
Cycle regular graphs need not be transitive.
Discret. Appl. Math., 2001

1997
Edge-Ends in Countable Graphs.
J. Comb. Theory, Ser. B, 1997

1995
On a Matrix Partition Conjecture.
J. Comb. Theory, Ser. A, 1995

On the ultimate independence ratio of a graph.
Eur. J. Comb., 1995

Minimal graphs that fold onto K<sub>n</sub>.
Discret. Math., 1995

1994
Preface.
Discret. Math., 1994

1991
Infinite friendship graphs with infinite parameters.
J. Comb. Theory, Ser. B, 1991

1990
A note concerning paths and independence number in digraphs.
Discret. Math., 1990

1989
Preface.
Discret. Appl. Math., 1989

1986
Concerning the achromatic number of graphs.
J. Comb. Theory, Ser. B, 1986

Path and cycle sub-ramsey numbers and an edge-colouring conjecture.
Discret. Math., 1986

1984
Infinite generalized friendship graphs.
Discret. Math., 1984

1983
Short cycles in mediate graphs.
Discret. Math., 1983

1981
The automorphism group of a product of hypergraphs.
J. Comb. Theory, Ser. B, 1981

More star sub-ramsey numbers.
Discret. Math., 1981

1980
The Automorphism Group of the Wreath Product of Directed Graphs.
Eur. J. Comb., 1980


  Loading...