default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHenning Bruhn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j50]Henning Bruhn, Arthur Ulmer:
Packing A-paths of length zero modulo four. Eur. J. Comb. 99: 103422 (2022)- [j49]Henning Bruhn
:
Even A-cycles have the edge-Erdős-Pósa property. J. Graph Theory 100(2): 281-293 (2022) - 2021
- [j48]Henning Bruhn, Matthias Heinlein, Felix Joos:
The Edge-Erdős-Pósa Property. Comb. 41(2): 147-173 (2021) - [j47]Henning Bruhn, Matthias Heinlein:
K4-Subdivisions Have the Edge-Erdös-Pósa Property. SIAM J. Discret. Math. 35(1): 392-430 (2021) - [j46]Henning Bruhn, Felix Joos, Oliver Schaudt:
Erdös-Pósa Property for Labeled Minors: 2-Connected Minors. SIAM J. Discret. Math. 35(2): 893-914 (2021)
2010 – 2019
- 2019
- [j45]Henning Bruhn, Matthias Heinlein, Felix Joos:
Long Cycles have the Edge-Erdős-Pósa Property. Comb. 39(1): 1-36 (2019) - 2018
- [j44]Henning Bruhn, Laura Gellert, Richard Lang:
Chromatic Index, Treewidth and Maximum Degree. Electron. J. Comb. 25(2): 2 (2018) - [j43]Henning Bruhn, Felix Joos:
A Stronger Bound for the Strong Chromatic Index. Comb. Probab. Comput. 27(1): 21-43 (2018) - [j42]Henning Bruhn, Felix Joos, Oliver Schaudt:
Long cycles through prescribed vertices have the Erdős-Pósa property. J. Graph Theory 87(3): 275-284 (2018) - [j41]Henning Bruhn, Matthias Heinlein, Felix Joos:
Frames, A-Paths, and the Erdös-Pósa Property. SIAM J. Discret. Math. 32(2): 1246-1260 (2018) - 2017
- [j40]Henning Bruhn, Oliver Schaudt:
The union-closed sets conjecture almost holds for almost all random bipartite graphs. Eur. J. Comb. 59: 129-149 (2017) - [j39]Henning Bruhn, Matthias Heinlein:
K4-expansions have the edge-Erdős-Pósa property. Electron. Notes Discret. Math. 61: 163-168 (2017) - [j38]Henning Bruhn, Laura Gellert, Jacob Günther:
Jacobsthal Numbers in Generalized Petersen Graphs. J. Graph Theory 84(2): 146-157 (2017) - [j37]Henning Bruhn, Elke Fuchs:
t-Perfection in P5-Free Graphs. SIAM J. Discret. Math. 31(3): 1616-1633 (2017) - [i4]Henning Bruhn, Oliver Schaudt:
Fast Algorithms for Delta-Separated Sparsity Projection. CoRR abs/1712.06706 (2017) - 2016
- [j36]Henning Bruhn, Morgan Chopin, Felix Joos, Oliver Schaudt:
Structural Parameterizations for Boxicity. Algorithmica 74(4): 1453-1472 (2016) - [j35]Henning Bruhn, Laura Gellert, Richard Lang:
Chromatic index, treewidth and maximum degree. Electron. Notes Discret. Math. 54: 259-264 (2016) - [j34]Henning Bruhn, Richard Lang, Maya Stein:
List Edge-Coloring and Total Coloring in Graphs of Low Treewidth. J. Graph Theory 81(3): 272-282 (2016) - [j33]Henning Bruhn, Oliver Schaudt:
Claw-Free t-Perfect Graphs Can Be Recognized in Polynomial Time. SIAM J. Discret. Math. 30(2): 832-855 (2016) - 2015
- [j32]Henning Bruhn, Pierre Charbit, Oliver Schaudt, Jan Arne Telle:
The graph formulation of the union-closed sets conjecture. Eur. J. Comb. 43: 210-219 (2015) - [j31]Henning Bruhn, Felix Joos:
A stronger bound for the strong chromatic index. Electron. Notes Discret. Math. 49: 277-284 (2015) - [j30]Henning Bruhn, Laura Gellert, Jacob Günther:
Jacobsthal numbers in generalised Petersen graphs. Electron. Notes Discret. Math. 49: 465-472 (2015) - [j29]Henning Bruhn, Oliver Schaudt:
The Journey of the Union-Closed Sets Conjecture. Graphs Comb. 31(6): 2043-2074 (2015) - [i3]Henning Bruhn, Felix Joos:
A stronger bound for the strong chromatic index. CoRR abs/1504.02583 (2015) - 2014
- [j28]Henning Bruhn:
Matroid and Tutte-connectivity in Infinite Graphs. Electron. J. Comb. 21(2): 2 (2014) - [j27]Henning Bruhn, Maya Stein:
Minimal bricks have many vertices of small degree. Eur. J. Comb. 36: 261-269 (2014) - [c3]Henning Bruhn, Oliver Schaudt:
Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time. IPCO 2014: 404-415 - [c2]Henning Bruhn, Morgan Chopin, Felix Joos, Oliver Schaudt:
Structural Parameterizations for Boxicity. WG 2014: 117-128 - 2013
- [j26]Henning Bruhn:
Colouring stability two unit disk graphs. Contributions Discret. Math. 8(2) (2013) - [j25]Henning Bruhn, Maya Stein:
Small degree vertices in minimal bricks. Electron. Notes Discret. Math. 44: 95-100 (2013) - [i2]Henning Bruhn, Oliver Schaudt:
The journey of the union-closed sets conjecture. CoRR abs/1309.3297 (2013) - [i1]Henning Bruhn, Oliver Schaudt:
Claw-free t-perfect graphs can be recognised in polynomial time. CoRR abs/1310.8186 (2013) - 2012
- [j24]Henning Bruhn, Paul Wollan:
Finite connectivity in infinite matroids. Eur. J. Comb. 33(8): 1900-1912 (2012) - [j23]Henning Bruhn, Akira Saito:
Clique or hole in claw-free graphs. J. Comb. Theory B 102(1): 1-13 (2012) - [j22]Henning Bruhn, Maya Stein:
On claw-free t-perfect graphs. Math. Program. 133(1-2): 461-480 (2012) - 2011
- [j21]Eli Berger, Henning Bruhn:
Eulerian edge sets in locally finite graphs. Comb. 31(1): 21-38 (2011) - [j20]Henning Bruhn, Reinhard Diestel:
Infinite matroids in graphs. Discret. Math. 311(15): 1461-1471 (2011) - [j19]Anthony Bonato, Henning Bruhn, Reinhard Diestel, Philipp Sprüssel:
Twins of rayless graphs. J. Comb. Theory B 101(1): 60-65 (2011) - 2010
- [j18]Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel:
Every rayless graph has an unfriendly partition. Comb. 30(5): 521-532 (2010) - [j17]Henning Bruhn, Maya Jakobine Stein:
Duality of Ends. Comb. Probab. Comput. 19(1): 47-60 (2010) - [j16]Henning Bruhn, Maya Stein:
t-Perfection Is Always Strong for Claw-Free Graphs. SIAM J. Discret. Math. 24(3): 770-781 (2010)
2000 – 2009
- 2009
- [j15]Henning Bruhn, Stefanie Kosuch, Melanie Win Myint:
Bicycles and left-right tours in locally finite graphs. Eur. J. Comb. 30(2): 356-371 (2009) - [j14]Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel:
Every rayless graph has an unfriendly partition. Electron. Notes Discret. Math. 34: 279-281 (2009) - [j13]Maya Stein, Henning Bruhn:
Characterising claw-free t-perfect graphs. Electron. Notes Discret. Math. 34: 501-507 (2009) - [j12]Henning Bruhn, Reinhard Diestel:
MacLane's theorem for arbitrary surfaces. J. Comb. Theory B 99(2): 275-286 (2009) - 2008
- [j11]Attila Bernáth, Henning Bruhn:
Degree Constrained Orientations in Countable Graphs. Electron. J. Comb. 15(1) (2008) - [j10]Henning Bruhn:
Periodical states and marching groups in a closed owari. Discret. Math. 308(16): 3694-3698 (2008) - [j9]Henning Bruhn, Xingxing Yu:
Hamilton Cycles in Planar Locally Finite Graphs. SIAM J. Discret. Math. 22(4): 1381-1392 (2008) - [j8]Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman, Jirí Sgall:
Single Source Multiroute Flows and Cuts on Uniform Capacity Networks. Theory Comput. 4(1): 1-20 (2008) - 2007
- [j7]Henning Bruhn, Maya Stein:
On end degrees and infinite cycles in locally finite graphs. Comb. 27(3): 269-291 (2007) - [c1]Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman:
Single source multiroute flows and cuts on uniform capacity networks. SODA 2007: 855-863 - 2006
- [j6]Henning Bruhn, Reinhard Diestel:
Duality in Infinite Graphs. Comb. Probab. Comput. 15(1-2): 75-90 (2006) - [j5]Henning Bruhn, Maya Jakobine Stein:
MacLane's planarity criterion for locally finite graphs. J. Comb. Theory B 96(2): 225-239 (2006) - 2005
- [j4]Henning Bruhn, Reinhard Diestel, Maya Stein:
Cycle-cocycle partitions and faithful cycle covers for locally finite graphs. J. Graph Theory 50(2): 150-161 (2005) - [j3]Henning Bruhn, Reinhard Diestel, Maya Stein:
Menger's theorem for infinite graphs with ends. J. Graph Theory 50(3): 199-211 (2005) - 2004
- [j2]Henning Bruhn:
The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits. J. Comb. Theory B 92(2): 235-256 (2004) - 2003
- [j1]Henning Bruhn:
Generating cycles in graphs with at most one end. J. Graph Theory 42(4): 342-349 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
