Henning Bruhn

From MaRDI portal
Person:289932

Available identifiers

zbMath Open bruhn.henningMaRDI QIDQ289932

List of research outcomes





PublicationDate of PublicationType
Even A‐cycles have the edge‐Erdős–Pósa property2023-10-05Paper
Subcubic graphs of large treewidth do not have the edge-Erd\H{o}s-P\'{o}sa property2023-06-15Paper
On the edge-Erd\H{o}s-P\'{o}sa property of walls2023-05-22Paper
Packing \(A\)-paths of length zero modulo four2021-10-28Paper
The edge-Erdős-Pósa property2021-09-22Paper
Erdös--Pósa Property for Labeled Minors: 2-Connected Minors2021-05-28Paper
Case study on scheduling cyclic conveyor belts2019-12-20Paper
Even $A$-cycles have the edge-Erd\H{o}s-P\'osa property2019-10-01Paper
Long cycles have the Edge-Erdős-Pósa property2019-05-23Paper
Maximal determinants of combinatorial matrices2018-06-20Paper
Frames, $A$-Paths, and the Erdös--Pósa Property2018-06-07Paper
Chromatic index, treewidth and maximum degree2018-05-25Paper
Long cycles through prescribed vertices have the Erdős‐Pósa property2018-04-27Paper
A Stronger Bound for the Strong Chromatic Index2018-01-19Paper
\(K_4\)-expansions have the edge-Erdős-Pósa property2018-01-18Paper
$t$-Perfection in $P_5$-Free Graphs2017-08-14Paper
Chromatic index, treewidth and maximum degree2017-02-13Paper
Jacobsthal Numbers in Generalized Petersen Graphs2017-02-01Paper
A stronger bound for the strong chromatic index (extended abstract)2016-10-14Paper
Jacobsthal numbers in generalised Petersen graphs2016-10-14Paper
The union-closed sets conjecture almost holds for almost all random bipartite graphs2016-10-12Paper
Long cycles have the edge-Erd\H{o}s-P\'osa property2016-07-07Paper
Structural parameterizations for boxicity2016-05-31Paper
Claw-free \(t\)-perfect graphs can be recognized in polynomial time2016-05-09Paper
List edge-coloring and total coloring in graphs of low treewidth2016-04-15Paper
The journey of the union-closed sets conjecture2015-12-17Paper
$h$-perfect plane triangulations2015-11-25Paper
https://portal.mardi4nfdi.de/entity/Q34490552015-11-03Paper
Structural parameterizations for boxicity2015-09-09Paper
Colouring stability two unit disk graphs2015-08-05Paper
https://portal.mardi4nfdi.de/entity/Q29346742014-12-18Paper
The graph formulation of the union-closed sets conjecture2014-10-08Paper
Matroid and Tutte-connectivity in infinite graphs2014-09-04Paper
The graph formulation of the union-closed sets conjecture2014-06-11Paper
The union-closed sets conjecture almost holds for almost all random bipartite graphs2014-06-11Paper
Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time2014-06-02Paper
Minimal bricks have many vertices of small degree2014-03-25Paper
Axioms for infinite matroids2014-01-08Paper
Characterising claw-free \(t\)-perfect graphs2013-10-10Paper
Every rayless graph has an unfriendly partition2013-10-10Paper
Finite connectivity in infinite matroids2012-09-12Paper
On claw-free \(t\)-perfect graphs2012-06-26Paper
Clique or hole in claw-free graphs2012-03-19Paper
Eulerian edge sets in locally finite graphs2011-12-20Paper
Every rayless graph has an unfriendly partition2011-12-19Paper
Infinite matroids in graphs2011-08-08Paper
Bases and closures under infinite sums2011-07-15Paper
t-Perfection Is Always Strong for Claw-Free Graphs2011-06-17Paper
https://portal.mardi4nfdi.de/entity/Q30027902011-05-24Paper
Twins of rayless graphs2011-01-14Paper
Duality of Ends2010-04-23Paper
Hamilton Cycles in Planar Locally Finite Graphs2009-11-27Paper
Degree constrained orientations in countable graphs2009-04-07Paper
Bicycles and left-right tours in locally finite graphs2009-03-04Paper
MacLane's theorem for arbitrary surfaces2009-03-04Paper
Periodical states and marching groups in a closed Owari2008-07-11Paper
On end degrees and infinite cycles in locally finite graphs2007-11-12Paper
MacLane's planarity criterion for locally finite graphs2006-04-28Paper
Duality in Infinite Graphs2006-03-13Paper
Menger's theorem for infinite graphs with ends2005-12-08Paper
Cycle‐cocycle partitions and faithful cycle covers for locally finite graphs2005-11-07Paper
The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits2005-02-16Paper
Generating cycles in graphs with at most one end2003-05-11Paper

Research outcomes over time

This page was built for person: Henning Bruhn