Prof. Dr. Henning Bruhn-Fujimoto

Universität Ulm
Institut für Optimierung und Operations Research
Helmholtzstraße 18
89081 Ulm

Büro: 1.66
Tel: +49  731 5023633
Email: Opens window for sending emailhenning.bruhn (at) uni-ulm.de

Sprechzeiten: jederzeit nach Vereinbarung per Email

Lehre

SS 2016

WS 2015

Publikationen

  • With M. Heinlein and F. Joos, Long cycles have the edge-Erdös-Pósa property, preprint 2016 Initiates file downloadPDF
  • With L. Gellert and R. Lang, Chromatic index, treewidth and maximum degree, preprint 2016 Initiates file downloadPDF
  • With Y. Benchetrit, h-perfect plane triangulations, preprint 2015 Initiates file downloadPDF
  • With E. Fuchs, t-perfection in near-bipartite and in P5-free graphs, preprint 2015 Initiates file downloadPDF
  • With F. Joos, A stronger bound for the strong chromatic index, preprint 2015 Initiates file downloadPDF
  • With L. Gellert and J. Günther, Jacobsthal numbers in generalised Petersen graphs, to appear in J. Graph Theory Initiates file downloadPDF
  • With F. Joos and O. Schaudt, Long cycles through prescribed vertices have the Erdös-Pósa property, preprint 2014 Initiates file downloadPDF
  • With M. ChopinF. Joos and O. Schaudt, Structural parameterizations for boxicity, to appear in Algorithmica Initiates file downloadPDF
  • With R. Lang and  M. Stein, List edge-colouring and total colouring in graphs of low treewidth, preprint 2013 Initiates file downloadPDF
  • With O. Schaudt, Claw-free t-perfect graphs can be recognised in polynomial time, to appear in SIAM J. Discrete Math. Initiates file downloadPDF
  • With O. Schaudt, The union-closed sets conjecture almost holds for almost all random bipartite graphs, to appear in Europ. J. Combin.  Initiates file downloadPDF
  • With P. Charbit, O. Schaudt and J.A. Telle, The graph formulation of the union-closed sets conjecture, Europ. J. Combin 43 (2015), 210-219 Initiates file downloadPDF
  • Matroid and Tutte-connectivity in infinite graphs, Electronic J. Comb. 21 (2014), #P2.14 Initiates file downloadPDF
  • With O. Schaudt, The journey of the union-closed sets conjecture, to appear in Graphs and Combinatorics Initiates file downloadPDF supplement
  • Colouring stability two unit disk graphs, Contributions to Discrete Mathematics 8 (2013) Initiates file downloadPDF
  • With M. Stein, Minimal bricks have many vertices of small degree, Europ. J. Combin. 36 (2014), 261-269 Initiates file downloadPDF
  • With R. Diestel, M. Kriesell, R. Pendavingh, and P. Wollan, Axioms for infinite matroids, Advances in Mathematics 239 (2013), 18-46 Initiates file downloadPDF
  • With P. Wollan, Finite connectivity in infinite matroids, Europ. J. Combin. 33 (2012), 1900-1912 Initiates file downloadPDF
  • With M. Stein, On claw-free t-perfect graphs, Math. Programming 133 (2012), 461-480 Initiates file downloadPDF Initiates file downloadsupplement
  • With A. Saito, Clique or hole in claw-free graphs, J. Combin. Theory (Series B) 102 (2012), 1-13 Initiates file downloadPDF
  • With E. Berger, Eulerian edge sets in locally finite graphs, Combinatorica 31 (2011), 21-38 Initiates file downloadPDF
  • With R. Diestel, Infinite matroids in graphs, Disc. Math. 311 (2011), 1461-1471 Initiates file downloadPDF
  • With A. Bonato, R. Diestel, and P. Sprüssel, Twins of rayless graphs, J. Combin. Theory (Series B) 101 (2011), 60-65 Initiates file downloadPDF
  • With A. Georgakopoulos, Bases and closures under infinite sums, Linear Algebra and its Applications 435 (2011), 2007-2018 Initiates file downloadPDF
  • With R. Diestel, A. Georgakopoulos and P. Sprüssel, Every rayless graph has an unfriendly partition, Combinatorica 30 (2010), 521-532 Initiates file downloadPDF
  • With M. Stein, t-perfection is always strong for claw-free graphs, SIAM. J. Discrete Math. 24 (2010), 770-781 Initiates file downloadPDF
  • With M. Stein, Duality of ends, Comb., Probab. Comput. 19 (2010), 47-60 Initiates file downloadPDF
  • With S. Kosuch and M. Win Myint, Bicycles and left-right tours in locally finite graphs, Europ. J. Combin. 30 (2009), 356-371 Initiates file downloadPDF
  • With R. Diestel, MacLane's theorem for arbitrary surfaces, J. Combin. Theory (Series B) 99 (2009), 275-286 Initiates file downloadPDF Initiates file downloadextended version
  • With A. Bernáth, Degree constrained orientations in countable graphs, Electronic J. Comb. 15 (2008), #R122 Initiates file downloadPDF Initiates file downloadsupplement
  • With X. Yu, Hamilton circles in planar locally finite graphs, SIAM. J. Discrete Math. 22 (2008), 1381-1392 Initiates file downloadPDF
  • With J. Cerný, A. Hall, P. Kolman and J. Sgall, Single source multiroute flows and cuts on uniform capacity networks, Theory of Computing 4 (2008), 1-20 Initiates file downloadPDF
  • Periodical states and marching groups in a closed owari, Disc. Math. 308 (2008), 3694-3698 Initiates file downloadPDF
  • With M. Stein, On end degrees and infinite circuits in locally finite graphs, Combinatorica 27 (2007), 269-291 Initiates file downloadPDF
  • With M. Stein, MacLane's planarity criterion for locally finite graphs, J. Combin. Theory (Series B) 96 (2006), 225-239 PDF
  • With R. Diestel, Duality in infinite graphs, Comb., Probab. Comput. 15 (2006), 75-90 Initiates file downloadPDF
  • With R. Diestel and M. Stein, Menger's theorem for infinite graphs with ends, J. Graph Theory 50 (2005), 199-211 Initiates file downloadPDF
  • With R. Diestel and M. Stein, Cycle-cocycle partitions and faithful cycle covers for locally finite graphs, J. Graph Theory 50 (2005), 150-161 Initiates file downloadPDF
  • The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits, J. Combin. Theory (Series B) 92 (2004), 235-256 Initiates file downloadPDF
  • Generating cycles in graphs with at most one end, J. Graph Theory 42 (2003) 342-349 Initiates file downloadPDF

Schriften

  • Graphs and their Circuits, Habilitationsschrift (2009) Initiates file downloadPDF
  • Infinite circuits in locally finite graphs, PhD thesis (2005) Initiates file downloadPDF
  • Generating the cycle space by induced non-separating cycles in locally finite graphs and in graphs with at most one end, diploma thesis (2001) Initiates file downloadPDF

Misc

I like to draw graphs and other figures. Here are some of my tikz drawings that others might find useful. You may copy, modify and use them in any way you see fit. There is no need to credit me.