The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Henning Bruhn: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Henning Bruhn
    The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:92, n:2, pp:235-256 [Journal]
  2. Henning Bruhn, Maya Jakobine Stein
    MacLane's planarity criterion for locally finite graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:2, pp:225-239 [Journal]
  3. Henning Bruhn, Reinhard Diestel, Maya Stein
    Menger's theorem for infinite graphs with ends. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:50, n:3, pp:199-211 [Journal]
  4. Henning Bruhn, Reinhard Diestel, Maya Stein
    Cycle-cocycle partitions and faithful cycle covers for locally finite graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:50, n:2, pp:150-161 [Journal]
  5. Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman
    Single source multiroute flows and cuts on uniform capacity networks. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:855-863 [Conf]

  6. On end degrees and infinite cycles in locally finite graphs. [Citation Graph (, )][DBLP]


  7. Duality in Infinite Graphs. [Citation Graph (, )][DBLP]


  8. Duality of Ends. [Citation Graph (, )][DBLP]


  9. Periodical states and marching groups in a closed owari. [Citation Graph (, )][DBLP]


  10. Bicycles and left-right tours in locally finite graphs. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
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