Gena Hahn - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 32 from 32

2024

On cop-win dynamic graphsGabriel Fortin-Leblanc, Gena Hahn, Frank Ramamonjisoa. DAM, 356:322-328, 2024. [doi]

2021

Edge clique covers in graphs with independence number twoPierre Charbit, Gena Hahn, Marcin Kaminski 0001, Manuel Lafond, Nicolas Lichiardopol, Reza Naserasr, Ben Seamone, Rezvan Sherkati. jgt, 97(2):324-339, 2021. [doi]

2019

A lower bound on the size of an absorbing set in an arc-coloured tournamentLaurent Beaudou, Luc Devroye, Gena Hahn. DM, 342(1):143-144, 2019. [doi]

2017

Cops and Robbers ordinals of cop-win treesAnthony Bonato, Przemyslaw Gordinowicz, Gena Hahn. DM, 340(5):951-956, 2017. [doi]

2012

Lexicographic products with high reconstruction numbersRichard C. Brewster, Gena Hahn, Stacey Wynn Lamont, Chester Lipka. DM, 312(10):1638-1645, 2012. [doi]

Some results on the injective chromatic number of graphsMin Chen, Gena Hahn, André Raspaud, Weifan Wang. jco, 24(3):299-318, 2012. [doi]

2011

PrefaceGena Hahn, Bojan Mohar. DM, 311(15):1389, 2011. [doi]

2010

Large classes of infinite ::::k::::-cop-win graphsAnthony Bonato, Gena Hahn, Claude Tardif. jgt, 65(4):334-342, 2010. [doi]

Some bounds on the injective chromatic number of graphsAlain Doyon, Gena Hahn, André Raspaud. DM, 310(3):585-590, 2010. [doi]

2009

Counting feasible solutions of the traveling salesman problem with pickups and deliveries is #P-completeGerardo Berbeglia, Gena Hahn. DAM, 157(11):2541-2547, 2009. [doi]

The capture time of a graphAnthony Bonato, Petr A. Golovach, Gena Hahn, Jan Kratochvíl. DM, 309(18):5588-5595, 2009. [doi]

2007

The cop density of a graphAnthony Bonato, Gena Hahn, Changping Wang. cdm, 2(2), 2007. [doi]

2006

A note on k-cop, l-robber games on graphsGena Hahn, Gary MacGillivray. DM, 306(19-20):2492-2497, 2006. [doi]

2005

PrefaceGena Hahn, Pierre Ille, Stéphan Thomassé. DM, 291(1-3):1, 2005. [doi]

2004

Absorbing sets in arc-coloured tournamentsGena Hahn, Pierre Ille, Robert E. Woodrow. DM, 283(1-3):93-99, 2004. [doi]

2002

On cop-win graphsGena Hahn, François Laviolette, Norbert Sauer, Robert E. Woodrow. DM, 258(1-3):27-41, 2002. [doi]

On the injective chromatic number of graphsGena Hahn, Jan Kratochvíl, Jozef Sirán, Dominique Sotteau. DM, 256(1-2):179-192, 2002. [doi]

2001

Cycle regular graphs need not be transitiveJean-Luc Fouquet, Gena Hahn. DAM, 113(2-3):261-264, 2001.

1997

Edge-Ends in Countable GraphsGena Hahn, François Laviolette, Jozef Sirán. JCT, 70(2):225-244, 1997. [doi]

1995

On a Matrix Partition ConjectureRichard A. Brualdi, Gena Hahn, Peter Horák, Earl S. Kramer, Stephen Mellendorf, Dale M. Mesner. JCT, 69(2):333-346, 1995.

Minimal graphs that fold onto K::n::Guo-Gang Gao, Gena Hahn. DM, 142(1-3):277-280, 1995. [doi]

On the ultimate independence ratio of a graphGena Hahn, Pavol Hell, Svatopluk Poljak. ejc, 16(3):253-261, 1995. [doi]

1991

Infinite friendship graphs with infinite parametersGena Hahn, Eric C. Milner, Robert E. Woodrow. JCT, 52(1):30-41, 1991. [doi]

1990

A note concerning paths and independence number in digraphsGena Hahn, Bill Jackson. DM, 82(3):327-329, 1990. [doi]

1989

PrefaceGena Hahn, Ivo G. Rosenberg. DAM, 24(1-3):1-2, 1989. [doi]

1986

Concerning the achromatic number of graphsMartin Farber, Gena Hahn, Pavol Hell, Donald Miller. JCT, 40(1):21-39, 1986. [doi]

Path and cycle sub-ramsey numbers and an edge-colouring conjectureGena Hahn, Carsten Thomassen. DM, 62(1):29-33, 1986. [doi]

1984

Infinite generalized friendship graphsCharles Delorme, Gena Hahn. DM, 49(3):261-266, 1984. [doi]

1983

Short cycles in mediate graphsGena Hahn, Dominique Sotteau, H. Sun. DM, 44(3):281-284, 1983. [doi]

1981

The automorphism group of a product of hypergraphsGena Hahn. JCT, 30(3):276-281, 1981. [doi]

More star sub-ramsey numbersGena Hahn. DM, 34(2):131-139, 1981. [doi]

1980

The Automorphism Group of the Wreath Product of Directed GraphsGena Hahn. ejc, 1(3):235-241, 1980. [doi]

Sign in or sign up to see more results.

runs on WebDSL