Generating cycles in graphs with at most one end. - Henning Bruhn (J. Graph Theory, 2003)

The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits. - Henning Bruhn (J. Comb. Theory B, 2004)

Cycle-cocycle partitions and faithful cycle covers for locally finite graphs. - Henning Bruhn; Reinhard Diestel; Maya Stein (J. Graph Theory, 2005)

Menger's theorem for infinite graphs with ends. - Henning Bruhn; Reinhard Diestel; Maya Stein (J. Graph Theory, 2005)

Duality in Infinite Graphs. - Henning Bruhn; Reinhard Diestel (Comb. Probab. Comput., 2006)

MacLane's planarity criterion for locally finite graphs. - Henning Bruhn; Maya Jakobine Stein (J. Comb. Theory B, 2006)

Single source multiroute flows and cuts on uniform capacity networks. - Henning Bruhn; Jakub Cerný; Alexander Hall; Petr Kolman (SODA, 2007)

On end degrees and infinite cycles in locally finite graphs. - Henning Bruhn; Maya Stein (Comb., 2007)

Degree Constrained Orientations in Countable Graphs. - Attila Bernáth; Henning Bruhn (Electron. J. Comb., 2008)

Periodical states and marching groups in a closed owari. - Henning Bruhn (Discret. Math., 2008)

Hamilton Cycles in Planar Locally Finite Graphs. - Henning Bruhn; Xingxing Yu (SIAM J. Discret. Math., 2008)

Single Source Multiroute Flows and Cuts on Uniform Capacity Networks. - Henning Bruhn; Jakub Cerný; Alexander Hall; Petr Kolman; Jirí Sgall (Theory Comput., 2008)

Bicycles and left-right tours in locally finite graphs. - Henning Bruhn; Stefanie Kosuch; Melanie Win Myint (Eur. J. Comb., 2009)

Every rayless graph has an unfriendly partition. - Henning Bruhn; Reinhard Diestel; Agelos Georgakopoulos; Philipp Sprüssel (Electron. Notes Discret. Math., 2009)

Characterising claw-free t-perfect graphs. - Maya Stein; Henning Bruhn (Electron. Notes Discret. Math., 2009)

MacLane's theorem for arbitrary surfaces. - Henning Bruhn; Reinhard Diestel (J. Comb. Theory B, 2009)

Duality of Ends. - Henning Bruhn; Maya Jakobine Stein (Comb. Probab. Comput., 2010)

t-Perfection Is Always Strong for Claw-Free Graphs. - Henning Bruhn; Maya Stein (SIAM J. Discret. Math., 2010)

Eulerian edge sets in locally finite graphs. - Eli Berger; Henning Bruhn (Comb., 2011)

Infinite matroids in graphs. - Henning Bruhn; Reinhard Diestel (Discret. Math., 2011)

Twins of rayless graphs. - Anthony Bonato; Henning Bruhn; Reinhard Diestel; Philipp Sprüssel (J. Comb. Theory B, 2011)

Finite connectivity in infinite matroids. - Henning Bruhn; Paul Wollan (Eur. J. Comb., 2012)

Clique or hole in claw-free graphs. - Henning Bruhn; Akira Saito (J. Comb. Theory B, 2012)

On claw-free t-perfect graphs. - Henning Bruhn; Maya Stein (Math. Program., 2012)

Colouring stability two unit disk graphs. - Henning Bruhn (Contributions Discret. Math., 2013)

Small degree vertices in minimal bricks. - Henning Bruhn; Maya Stein (Electron. Notes Discret. Math., 2013)

Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time. - Henning Bruhn; Oliver Schaudt (IPCO, 2014)

Matroid and Tutte-connectivity in Infinite Graphs. - Henning Bruhn (Electron. J. Comb., 2014)

Minimal bricks have many vertices of small degree. - Henning Bruhn; Maya Stein (Eur. J. Comb., 2014)

The graph formulation of the union-closed sets conjecture. - Henning Bruhn; Pierre Charbit; Oliver Schaudt; Jan Arne Telle (Eur. J. Comb., 2015)

Jacobsthal numbers in generalised Petersen graphs. - Henning Bruhn; Laura Gellert; Jacob Günther (Electron. Notes Discret. Math., 2015)

A stronger bound for the strong chromatic index. - Henning Bruhn; Felix Joos (Electron. Notes Discret. Math., 2015)

The Journey of the Union-Closed Sets Conjecture. - Henning Bruhn; Oliver Schaudt (Graphs Comb., 2015)

Structural Parameterizations for Boxicity. - Henning Bruhn; Morgan Chopin; Felix Joos; Oliver Schaudt (Algorithmica, 2016)

Chromatic index, treewidth and maximum degree. - Henning Bruhn; Laura Gellert; Richard Lang (Electron. Notes Discret. Math., 2016)

List Edge-Coloring and Total Coloring in Graphs of Low Treewidth. - Henning Bruhn; Richard Lang; Maya Stein (J. Graph Theory, 2016)

Claw-Free t-Perfect Graphs Can Be Recognized in Polynomial Time. - Henning Bruhn; Oliver Schaudt (SIAM J. Discret. Math., 2016)

Fast Algorithms for Delta-Separated Sparsity Projection. - Henning Bruhn; Oliver Schaudt (CoRR, 2017)

The union-closed sets conjecture almost holds for almost all random bipartite graphs. - Henning Bruhn; Oliver Schaudt (Eur. J. Comb., 2017)

K4-expansions have the edge-Erdős-Pósa property. - Henning Bruhn; Matthias Heinlein (Electron. Notes Discret. Math., 2017)

Jacobsthal Numbers in Generalized Petersen Graphs. - Henning Bruhn; Laura Gellert; Jacob Günther (J. Graph Theory, 2017)

t-Perfection in P5-Free Graphs. - Henning Bruhn; Elke Fuchs (SIAM J. Discret. Math., 2017)

Long cycles through prescribed vertices have the Erdős-Pósa property. - Henning Bruhn; Felix Joos; Oliver Schaudt (J. Graph Theory, 2018)

Frames, A-Paths, and the Erdös-Pósa Property. - Henning Bruhn; Matthias Heinlein; Felix Joos (SIAM J. Discret. Math., 2018)

Long Cycles have the Edge-Erdős-Pósa Property. - Henning Bruhn; Matthias Heinlein; Felix Joos (Comb., 2019)

The Edge-Erdős-Pósa Property. - Henning Bruhn; Matthias Heinlein; Felix Joos (Comb., 2021)

K4-Subdivisions Have the Edge-Erdös-Pósa Property. - Henning Bruhn; Matthias Heinlein (SIAM J. Discret. Math., 2021)

Erdös-Pósa Property for Labeled Minors: 2-Connected Minors. - Henning Bruhn; Felix Joos; Oliver Schaudt (SIAM J. Discret. Math., 2021)

Packing A-paths of length zero modulo four. - Henning Bruhn; Arthur Ulmer (Eur. J. Comb., 2022)

Even A-cycles have the edge-Erdős-Pósa property. - Henning Bruhn (J. Graph Theory, 2022)