default search action
Gena Hahn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j33]Gabriel Fortin-Leblanc, Gena Hahn, Frank Ramamonjisoa:
On cop-win dynamic graphs. Discret. Appl. Math. 356: 322-328 (2024) - 2021
- [j32]Pierre Charbit
, Gena Hahn, Marcin Kaminski, Manuel Lafond, Nicolas Lichiardopol, Reza Naserasr
Edge clique covers in graphs with independence number two. J. Graph Theory 97(2): 324-339 (2021)
2010 – 2019
- 2019
- [j31]Laurent Beaudou
A lower bound on the size of an absorbing set in an arc-coloured tournament. Discret. Math. 342(1): 143-144 (2019) - 2017
- [j30]Anthony Bonato, Przemyslaw Gordinowicz
Cops and Robbers ordinals of cop-win trees. Discret. Math. 340(5): 951-956 (2017) - 2012
- [j29]Richard C. Brewster, Gena Hahn, Stacey Wynn Lamont, Chester Lipka:
Lexicographic products with high reconstruction numbers. Discret. Math. 312(10): 1638-1645 (2012) - [j28]Min Chen, Gena Hahn, André Raspaud, Weifan Wang:
Some results on the injective chromatic number of graphs. J. Comb. Optim. 24(3): 299-318 (2012) - 2011
- [j27]Gena Hahn, Bojan Mohar:
Preface. Discret. Math. 311(15): 1389 (2011) - 2010
- [j26]Alain Doyon, Gena Hahn, André Raspaud:
Some bounds on the injective chromatic number of graphs. Discret. Math. 310(3): 585-590 (2010) - [j25]Anthony Bonato, Gena Hahn, Claude Tardif:
Large classes of infinite k-cop-win graphs. J. Graph Theory 65(4): 334-342 (2010)
2000 – 2009
- 2009
- [j24]Gerardo Berbeglia
Counting feasible solutions of the traveling salesman problem with pickups and deliveries is #P-complete. Discret. Appl. Math. 157(11): 2541-2547 (2009) - [j23]Anthony Bonato, Petr A. Golovach
The capture time of a graph. Discret. Math. 309(18): 5588-5595 (2009) - 2007
- [j22]Anthony Bonato, Gena Hahn, Changping Wang:
The cop density of a graph. Contributions Discret. Math. 2(2) (2007) - 2006
- [j21]Gena Hahn, Gary MacGillivray:
A note on k-cop, l-robber games on graphs. Discret. Math. 306(19-20): 2492-2497 (2006) - 2005
- [j20]Gena Hahn, Pierre Ille, Stéphan Thomassé:
Preface. Discret. Math. 291(1-3): 1- (2005) - 2004
- [j19]Gena Hahn, Pierre Ille, Robert E. Woodrow:
Absorbing sets in arc-coloured tournaments. Discret. Math. 283(1-3): 93-99 (2004) - 2002
- [j18]Gena Hahn, Jan Kratochvíl
On the injective chromatic number of graphs. Discret. Math. 256(1-2): 179-192 (2002) - [j17]Gena Hahn, François Laviolette, Norbert Sauer, Robert E. Woodrow:
On cop-win graphs. Discret. Math. 258(1-3): 27-41 (2002) - 2001
- [j16]Jean-Luc Fouquet, Gena Hahn:
Cycle regular graphs need not be transitive. Discret. Appl. Math. 113(2-3): 261-264 (2001)
1990 – 1999
- 1997
- [j15]Gena Hahn, François Laviolette, Jozef Sirán:
Edge-Ends in Countable Graphs. J. Comb. Theory B 70(2): 225-244 (1997) - 1995
- [j14]Guo-Gang Gao, Gena Hahn:
Minimal graphs that fold onto Kn. Discret. Math. 142(1-3): 277-280 (1995) - [j13]Gena Hahn, Pavol Hell, Svatopluk Poljak:
On the ultimate independence ratio of a graph. Eur. J. Comb. 16(3): 253-261 (1995) - [j12]Richard A. Brualdi, Gena Hahn, Peter Horák, Earl S. Kramer, Stephen Mellendorf, Dale M. Mesner:
On a Matrix Partition Conjecture. J. Comb. Theory A 69(2): 333-346 (1995) - 1994
- [j11]Achille Achache, Gena Hahn, Maurice Pouzet, Ivo G. Rosenberg:
Preface. Discret. Math. 130(1-3): 1 (1994) - 1991
- [j10]Gena Hahn, Eric C. Milner, Robert E. Woodrow:
Infinite friendship graphs with infinite parameters. J. Comb. Theory B 52(1): 30-41 (1991) - 1990
- [j9]Gena Hahn, Bill Jackson:
A note concerning paths and independence number in digraphs. Discret. Math. 82(3): 327-329 (1990)
1980 – 1989
- 1989
- [j8]Gena Hahn, Ivo G. Rosenberg:
Preface. Discret. Appl. Math. 24(1-3): 1-2 (1989) - 1986
- [j7]Gena Hahn, Carsten Thomassen:
Path and cycle sub-ramsey numbers and an edge-colouring conjecture. Discret. Math. 62(1): 29-33 (1986) - [j6]Martin Farber, Gena Hahn, Pavol Hell, Donald J. Miller:
Concerning the achromatic number of graphs. J. Comb. Theory B 40(1): 21-39 (1986) - 1984
- [j5]Charles Delorme, Gena Hahn:
Infinite generalized friendship graphs. Discret. Math. 49(3): 261-266 (1984) - 1983
- [j4]Gena Hahn, Dominique Sotteau, H. Sun:
Short cycles in mediate graphs. Discret. Math. 44(3): 281-284 (1983) - 1981
- [j3]Gena Hahn:
More star sub-ramsey numbers. Discret. Math. 34(2): 131-139 (1981) - [j2]Gena Hahn:
The automorphism group of a product of hypergraphs. J. Comb. Theory B 30(3): 276-281 (1981) - 1980
- [j1]Gena Hahn:
The Automorphism Group of the Wreath Product of Directed Graphs. Eur. J. Comb. 1(3): 235-241 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: