Henning Bruhn

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Even A‐cycles have the edge‐Erdős–Pósa property Journal of Graph Theory	2023-10-05	Paper
Subcubic graphs of large treewidth do not have the edge-Erd\H{o}s-P\'{o}sa property	2023-06-15	Paper
On the edge-Erd\H{o}s-P\'{o}sa property of walls	2023-05-22	Paper
Packing $A$-paths of length zero modulo four European Journal of Combinatorics	2021-10-28	Paper
The edge-Erdős-Pósa property Combinatorica	2021-09-22	Paper
Erdős-Pósa property for labeled minors: 2-connected minors SIAM Journal on Discrete Mathematics	2021-05-28	Paper
Case study on scheduling cyclic conveyor belts	2019-12-20	Paper
Even $A$-cycles have the edge-Erd\H{o}s-P\'osa property	2019-10-01	Paper
Long cycles have the Edge-Erdős-Pósa property Combinatorica	2019-05-23	Paper
Maximal determinants of combinatorial matrices Linear Algebra and its Applications	2018-06-20	Paper
Frames, $A$-paths, and the Erdős-Pósa property SIAM Journal on Discrete Mathematics	2018-06-07	Paper
Chromatic index, treewidth and maximum degree The Electronic Journal of Combinatorics	2018-05-25	Paper
Long cycles through prescribed vertices have the Erdős-Pósa property Journal of Graph Theory	2018-04-27	Paper
A stronger bound for the strong chromatic index Combinatorics, Probability and Computing	2018-01-19	Paper
$K_4$-expansions have the edge-Erdős-Pósa property	2018-01-18	Paper
$t$-perfection in $P_5$-free graphs SIAM Journal on Discrete Mathematics	2017-08-14	Paper
Chromatic index, treewidth and maximum degree Electronic Notes in Discrete Mathematics	2017-02-13	Paper
Jacobsthal Numbers in Generalized Petersen Graphs Journal of Graph Theory	2017-02-01	Paper
A stronger bound for the strong chromatic index (extended abstract)	2016-10-14	Paper
Jacobsthal numbers in generalised Petersen graphs (available as arXiv preprint)	2016-10-14	Paper
The union-closed sets conjecture almost holds for almost all random bipartite graphs European Journal of Combinatorics	2016-10-12	Paper
Long cycles have the edge-Erd\H{o}s-P\'osa property (available as arXiv preprint)	2016-07-07	Paper
Structural parameterizations for boxicity Algorithmica	2016-05-31	Paper
Claw-free $t$-perfect graphs can be recognized in polynomial time SIAM Journal on Discrete Mathematics	2016-05-09	Paper
List edge-coloring and total coloring in graphs of low treewidth Journal of Graph Theory	2016-04-15	Paper
The journey of the union-closed sets conjecture Graphs and Combinatorics	2015-12-17	Paper
$h$-perfect plane triangulations	2015-11-25	Paper
scientific article; zbMATH DE number 6503891 (Why is no real title available?)	2015-11-03	Paper
Structural parameterizations for boxicity Lecture Notes in Computer Science	2015-09-09	Paper
Colouring stability two unit disk graphs (available as arXiv preprint)	2015-08-05	Paper
Single source multiroute flows and cuts on uniform capacity networks	2014-12-18	Paper
The graph formulation of the union-closed sets conjecture European Journal of Combinatorics	2014-10-08	Paper
Matroid and Tutte-connectivity in infinite graphs The Electronic Journal of Combinatorics	2014-09-04	Paper
Matroid and Tutte-connectivity in infinite graphs The Electronic Journal of Combinatorics	2014-09-04	Paper
The union-closed sets conjecture almost holds for almost all random bipartite graphs (available as arXiv preprint)	2014-06-11	Paper
The graph formulation of the union-closed sets conjecture The Seventh European Conference on Combinatorics, Graph Theory and Applications	2014-06-11	Paper
Claw-free $t$-perfect graphs can be recognised in polynomial time Integer Programming and Combinatorial Optimization	2014-06-02	Paper
Minimal bricks have many vertices of small degree European Journal of Combinatorics	2014-03-25	Paper
Axioms for infinite matroids Advances in Mathematics	2014-01-08	Paper
Characterising claw-free $t$-perfect graphs Electronic Notes in Discrete Mathematics	2013-10-10	Paper
Every rayless graph has an unfriendly partition Electronic Notes in Discrete Mathematics	2013-10-10	Paper
Finite connectivity in infinite matroids European Journal of Combinatorics	2012-09-12	Paper
On claw-free $t$-perfect graphs Mathematical Programming. Series A. Series B	2012-06-26	Paper
Clique or hole in claw-free graphs Journal of Combinatorial Theory. Series B	2012-03-19	Paper
Eulerian edge sets in locally finite graphs Combinatorica	2011-12-20	Paper
Every rayless graph has an unfriendly partition Combinatorica	2011-12-19	Paper
Infinite matroids in graphs Discrete Mathematics	2011-08-08	Paper
Bases and closures under infinite sums Linear Algebra and its Applications	2011-07-15	Paper
$t$-perfection is always strong for claw-free graphs SIAM Journal on Discrete Mathematics	2011-06-17	Paper
Single source multiroute flows and cuts on uniform capacity networks Theory of Computing	2011-05-24	Paper
Twins of rayless graphs Journal of Combinatorial Theory. Series B	2011-01-14	Paper
Duality of ends Combinatorics, Probability and Computing	2010-04-23	Paper
Hamilton Cycles in Planar Locally Finite Graphs SIAM Journal on Discrete Mathematics	2009-11-27	Paper
Degree constrained orientations in countable graphs The Electronic Journal of Combinatorics	2009-04-07	Paper
Degree constrained orientations in countable graphs The Electronic Journal of Combinatorics	2009-04-07	Paper
Bicycles and left-right tours in locally finite graphs European Journal of Combinatorics	2009-03-04	Paper
MacLane's theorem for arbitrary surfaces Journal of Combinatorial Theory. Series B	2009-03-04	Paper
Periodical states and marching groups in a closed Owari Discrete Mathematics	2008-07-11	Paper
On end degrees and infinite cycles in locally finite graphs Combinatorica	2007-11-12	Paper
MacLane's planarity criterion for locally finite graphs Journal of Combinatorial Theory. Series B	2006-04-28	Paper
Duality in Infinite Graphs Combinatorics, Probability and Computing	2006-03-13	Paper
Menger's theorem for infinite graphs with ends Journal of Graph Theory	2005-12-08	Paper
Cycle‐cocycle partitions and faithful cycle covers for locally finite graphs Journal of Graph Theory	2005-11-07	Paper
The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits Journal of Combinatorial Theory. Series B	2005-02-16	Paper
Generating cycles in graphs with at most one end Journal of Graph Theory	2003-05-11	Paper

Research outcomes over time

This page was built for person: Henning Bruhn