Henning Bruhn

Publication Activity (10 Years)

Years Active: 2003-2022
Publications (10 Years): 24

Top Topics

Bounded Treewidth

Emerging Patterns

Bipartite Graph

Top Venues

SIAM J. Discret. Math.

Electron. Notes Discret. Math.

J. Graph Theory

Publications

Henning Bruhn, Arthur Ulmer
Packing A-paths of length zero modulo four. Eur. J. Comb. 99 (2022)
Henning Bruhn
Even A-cycles have the edge-Erdős-Pósa property. J. Graph Theory 100 (2) (2022)
Henning Bruhn, Felix Joos, Oliver Schaudt
Erdös-Pósa Property for Labeled Minors: 2-Connected Minors. SIAM J. Discret. Math. 35 (2) (2021)
Henning Bruhn, Matthias Heinlein, Felix Joos
The Edge-Erdős-Pósa Property. Comb. 41 (2) (2021)
Henning Bruhn, Matthias Heinlein
-Subdivisions Have the Edge-Erdös-Pósa Property. SIAM J. Discret. Math. 35 (1) (2021)
Henning Bruhn, Matthias Heinlein, Felix Joos
Long Cycles have the Edge-Erdős-Pósa Property. Comb. 39 (1) (2019)
Henning Bruhn, Felix Joos
A Stronger Bound for the Strong Chromatic Index. Comb. Probab. Comput. 27 (1) (2018)
Henning Bruhn, Matthias Heinlein, Felix Joos
Frames, A-Paths, and the Erdös-Pósa Property. SIAM J. Discret. Math. 32 (2) (2018)
Henning Bruhn, Laura Gellert, Richard Lang
Chromatic Index, Treewidth and Maximum Degree. Electron. J. Comb. 25 (2) (2018)
Henning Bruhn, Felix Joos, Oliver Schaudt
Long cycles through prescribed vertices have the Erdős-Pósa property. J. Graph Theory 87 (3) (2018)
Henning Bruhn, Oliver Schaudt
Fast Algorithms for Delta-Separated Sparsity Projection. CoRR (2017)
Henning Bruhn, Oliver Schaudt
The union-closed sets conjecture almost holds for almost all random bipartite graphs. Eur. J. Comb. 59 (2017)
Henning Bruhn, Laura Gellert, Jacob Günther
Jacobsthal Numbers in Generalized Petersen Graphs. J. Graph Theory 84 (2) (2017)
Henning Bruhn, Elke Fuchs
-Free Graphs. SIAM J. Discret. Math. 31 (3) (2017)
Henning Bruhn, Matthias Heinlein
-expansions have the edge-Erdős-Pósa property. Electron. Notes Discret. Math. 61 (2017)
Henning Bruhn, Morgan Chopin, Felix Joos, Oliver Schaudt
Structural Parameterizations for Boxicity. Algorithmica 74 (4) (2016)
Henning Bruhn, Oliver Schaudt
Claw-Free t-Perfect Graphs Can Be Recognized in Polynomial Time. SIAM J. Discret. Math. 30 (2) (2016)
Henning Bruhn, Richard Lang, Maya Stein
List Edge-Coloring and Total Coloring in Graphs of Low Treewidth. J. Graph Theory 81 (3) (2016)
Henning Bruhn, Laura Gellert, Richard Lang
Chromatic index, treewidth and maximum degree. Electron. Notes Discret. Math. 54 (2016)
Henning Bruhn, Laura Gellert, Jacob Günther
Jacobsthal numbers in generalised Petersen graphs. Electron. Notes Discret. Math. 49 (2015)
Henning Bruhn, Oliver Schaudt
The Journey of the Union-Closed Sets Conjecture. Graphs Comb. 31 (6) (2015)
Henning Bruhn, Felix Joos
A stronger bound for the strong chromatic index. Electron. Notes Discret. Math. 49 (2015)
Henning Bruhn, Felix Joos
A stronger bound for the strong chromatic index. CoRR (2015)
Henning Bruhn, Pierre Charbit, Oliver Schaudt, Jan Arne Telle
The graph formulation of the union-closed sets conjecture. Eur. J. Comb. 43 (2015)
Henning Bruhn, Morgan Chopin, Felix Joos, Oliver Schaudt
Structural Parameterizations for Boxicity. WG (2014)
Henning Bruhn
Matroid and Tutte-connectivity in Infinite Graphs. Electron. J. Comb. 21 (2) (2014)
Henning Bruhn, Maya Stein
Minimal bricks have many vertices of small degree. Eur. J. Comb. 36 (2014)
Henning Bruhn, Oliver Schaudt
Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time. IPCO (2014)
Henning Bruhn
Colouring stability two unit disk graphs. Contributions Discret. Math. 8 (2) (2013)
Henning Bruhn, Maya Stein
Small degree vertices in minimal bricks. Electron. Notes Discret. Math. 44 (2013)
Henning Bruhn, Oliver Schaudt
Claw-free t-perfect graphs can be recognised in polynomial time. CoRR (2013)
Henning Bruhn, Oliver Schaudt
The journey of the union-closed sets conjecture. CoRR (2013)
Henning Bruhn, Akira Saito
Clique or hole in claw-free graphs. J. Comb. Theory, Ser. B 102 (1) (2012)
Henning Bruhn, Paul Wollan
Finite connectivity in infinite matroids. Eur. J. Comb. 33 (8) (2012)
Henning Bruhn, Maya Stein
On claw-free t-perfect graphs. Math. Program. 133 (1-2) (2012)
Anthony Bonato, Henning Bruhn, Reinhard Diestel, Philipp Sprüssel
Twins of rayless graphs. J. Comb. Theory, Ser. B 101 (1) (2011)
Henning Bruhn, Reinhard Diestel
Infinite matroids in graphs. Discret. Math. 311 (15) (2011)
Eli Berger, Henning Bruhn
Eulerian edge sets in locally finite graphs. Comb. 31 (1) (2011)
Henning Bruhn, Maya Jakobine Stein
Duality of Ends. Comb. Probab. Comput. 19 (1) (2010)
Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel
Every rayless graph has an unfriendly partition. Comb. 30 (5) (2010)
Henning Bruhn, Maya Stein
t-Perfection Is Always Strong for Claw-Free Graphs. SIAM J. Discret. Math. 24 (3) (2010)
Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel
Every rayless graph has an unfriendly partition. Electron. Notes Discret. Math. 34 (2009)
Henning Bruhn, Reinhard Diestel
MacLane's theorem for arbitrary surfaces. J. Comb. Theory, Ser. B 99 (2) (2009)
Maya Stein, Henning Bruhn
Characterising claw-free t-perfect graphs. Electron. Notes Discret. Math. 34 (2009)
Henning Bruhn, Stefanie Kosuch, Melanie Win Myint
Bicycles and left-right tours in locally finite graphs. Eur. J. Comb. 30 (2) (2009)
Henning Bruhn
Periodical states and marching groups in a closed owari. Discret. Math. 308 (16) (2008)
Henning Bruhn, Xingxing Yu
Hamilton Cycles in Planar Locally Finite Graphs. SIAM J. Discret. Math. 22 (4) (2008)
Attila Bernáth, Henning Bruhn
Degree Constrained Orientations in Countable Graphs. Electron. J. Comb. 15 (1) (2008)
Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman, Jirí Sgall
Single Source Multiroute Flows and Cuts on Uniform Capacity Networks. Theory Comput. 4 (1) (2008)
Henning Bruhn, Maya Stein
On end degrees and infinite cycles in locally finite graphs. Comb. 27 (3) (2007)
Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman
Single source multiroute flows and cuts on uniform capacity networks. SODA (2007)
Henning Bruhn, Reinhard Diestel
Duality in Infinite Graphs. Comb. Probab. Comput. 15 (1-2) (2006)
Henning Bruhn, Maya Jakobine Stein
MacLane's planarity criterion for locally finite graphs. J. Comb. Theory, Ser. B 96 (2) (2006)
Henning Bruhn, Reinhard Diestel, Maya Stein
Menger's theorem for infinite graphs with ends. J. Graph Theory 50 (3) (2005)
Henning Bruhn, Reinhard Diestel, Maya Stein
Cycle-cocycle partitions and faithful cycle covers for locally finite graphs. J. Graph Theory 50 (2) (2005)
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) (2004)
Henning Bruhn
Generating cycles in graphs with at most one end. J. Graph Theory 42 (4) (2003)