The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gena Hahn: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jean-Luc Fouquet, Gena Hahn
    Cycle regular graphs need not be transitive. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:261-264 [Journal]
  2. Gena Hahn, Pierre Ille, Stéphan Thomassé
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:291, n:1-3, pp:1-0 [Journal]
  3. Gena Hahn, Pierre Ille, Robert E. Woodrow
    Absorbing sets in arc-coloured tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:283, n:1-3, pp:93-99 [Journal]
  4. Gena Hahn, Jan Kratochvíl, Jozef Sirán, Dominique Sotteau
    On the injective chromatic number of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:179-192 [Journal]
  5. Gena Hahn, François Laviolette, Norbert Sauer, Robert E. Woodrow
    On cop-win graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:258, n:1-3, pp:27-41 [Journal]
  6. Gena Hahn, Gary MacGillivray
    A note on k-cop, l-robber games on graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:19-20, pp:2492-2497 [Journal]
  7. Richard A. Brualdi, Gena Hahn, Peter Horák, Earl S. Kramer, Stephen Mellendorf, Dale M. Mesner
    On a Matrix Partition Conjecture. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1995, v:69, n:2, pp:333-346 [Journal]
  8. Martin Farber, Gena Hahn, Pavol Hell, Donald Miller
    Concerning the achromatic number of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1986, v:40, n:1, pp:21-39 [Journal]
  9. Gena Hahn, François Laviolette, Jozef Sirán
    Edge-Ends in Countable Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:70, n:2, pp:225-244 [Journal]
  10. Gena Hahn, Eric C. Milner, Robert E. Woodrow
    Infinite friendship graphs with infinite parameters. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:30-41 [Journal]
  11. Gena Hahn
    The automorphism group of a product of hypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:3, pp:276-281 [Journal]
  12. Gena Hahn
    More star sub-ramsey numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:34, n:2, pp:131-139 [Journal]
  13. Gena Hahn, Dominique Sotteau, H. Sun
    Short cycles in mediate graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:44, n:3, pp:281-284 [Journal]
  14. Gena Hahn, Carsten Thomassen
    Path and cycle sub-ramsey numbers and an edge-colouring conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:62, n:1, pp:29-33 [Journal]
  15. Charles Delorme, Gena Hahn
    Infinite generalized friendship graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:49, n:3, pp:261-266 [Journal]
  16. Gena Hahn, Bill Jackson
    A note concerning paths and independence number in digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:82, n:3, pp:327-329 [Journal]
  17. Guo-Gang Gao, Gena Hahn
    Minimal graphs that fold onto Kn. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:142, n:1-3, pp:277-280 [Journal]

  18. Preface. [Citation Graph (, )][DBLP]


  19. Counting feasible solutions of the traveling salesman problem with pickups and deliveries is #P-complete. [Citation Graph (, )][DBLP]


  20. The capture time of a graph. [Citation Graph (, )][DBLP]


  21. Some bounds on the injective chromatic number of graphs. [Citation Graph (, )][DBLP]


Search in 0.032secs, Finished in 0.034secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002