Henning Bruhn

	2012
23		Henning Bruhn, Akira Saito: Clique or hole in claw-free graphs. J. Comb. Theory, Ser. B 102(1): 1-13 (2012)
22		Henning Bruhn, Maya Stein: On claw-free t-perfect graphs. Math. Program. 133(1-2): 461-480 (2012)
	2011
21		Eli Berger, Henning Bruhn: Eulerian edge sets in locally finite graphs. Combinatorica 31(1): 21-38 (2011)
20		Henning Bruhn, Reinhard Diestel: Infinite matroids in graphs. Discrete Mathematics 311(15): 1461-1471 (2011)
19		Anthony Bonato, Henning Bruhn, Reinhard Diestel, Philipp Sprüssel: Twins of rayless graphs. J. Comb. Theory, Ser. B 101(1): 60-65 (2011)
	2010
18		Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel: Every rayless graph has an unfriendly partition. Combinatorica 30(5): 521-532 (2010)
17		Henning Bruhn, Maya Jakobine Stein: Duality of Ends. Combinatorics, Probability & Computing 19(1): 47-60 (2010)
16		Henning Bruhn, Maya Stein: t-Perfection Is Always Strong for Claw-Free Graphs. SIAM J. Discrete Math. 24(3): 770-781 (2010)
	2009
15		Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel: Every rayless graph has an unfriendly partition. Electronic Notes in Discrete Mathematics 34: 279-281 (2009)
14		Maya Stein, Henning Bruhn: Characterising claw-free t-perfect graphs. Electronic Notes in Discrete Mathematics 34: 501-507 (2009)
13		Henning Bruhn, Stefanie Kosuch, Melanie Win Myint: Bicycles and left-right tours in locally finite graphs. Eur. J. Comb. 30(2): 356-371 (2009)
12		Henning Bruhn, Reinhard Diestel: MacLane's theorem for arbitrary surfaces. J. Comb. Theory, Ser. B 99(2): 275-286 (2009)
	2008
11		Henning Bruhn: Periodical states and marching groups in a closed owari. Discrete Mathematics 308(16): 3694-3698 (2008)
10		Attila Bernáth, Henning Bruhn: Degree Constrained Orientations in Countable Graphs. Electr. J. Comb. 15(1): (2008)
9		Henning Bruhn, Xingxing Yu: Hamilton Cycles in Planar Locally Finite Graphs. SIAM J. Discrete Math. 22(4): 1381-1392 (2008)
8		Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman, Jiri Sgall: Single Source Multiroute Flows and Cuts on Uniform Capacity Networks. Theory of Computing 4(1): 1-20 (2008)
	2007
7		Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman: Single source multiroute flows and cuts on uniform capacity networks. SODA 2007: 855-863
6		Henning Bruhn, Maya Stein: On end degrees and infinite cycles in locally finite graphs. Combinatorica 27(3): 269-291 (2007)
	2006
5		Henning Bruhn, Reinhard Diestel: Duality in Infinite Graphs. Combinatorics, Probability & Computing 15(1-2): 75-90 (2006)
4		Henning Bruhn, Maya Jakobine Stein: MacLane's planarity criterion for locally finite graphs. J. Comb. Theory, Ser. B 96(2): 225-239 (2006)
	2005
3		Henning Bruhn, Reinhard Diestel, Maya Stein: Cycle-cocycle partitions and faithful cycle covers for locally finite graphs. Journal of Graph Theory 50(2): 150-161 (2005)
2		Henning Bruhn, Reinhard Diestel, Maya Stein: Menger's theorem for infinite graphs with ends. Journal of Graph Theory 50(3): 199-211 (2005)
	2004
1		Henning Bruhn: The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits. J. Comb. Theory, Ser. B 92(2): 235-256 (2004)

Coauthor Index

1	Eli Berger	[21]
2	Attila Bernáth	[10]
3	Anthony Bonato	[19]
4	Jakub Cerný	[7] [8]
5	Reinhard Diestel	[2] [3] [5] [12] [15] [18] [19] [20]
6	Agelos Georgakopoulos	[15] [18]
7	Alexander Hall	[7] [8]
8	Petr Kolman	[7] [8]
9	Stefanie Kosuch	[13]
10	Melanie Win Myint	[13]
11	Akira Saito	[23]
12	Jiri Sgall	[8]
13	Philipp Sprüssel	[15] [18] [19]
14	Maya Jakobine Stein (Maya Stein)	[2] [3] [4] [6] [14] [16] [17] [22]
15	Xingxing Yu	[9]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page