19 citations · 41 across the 26 of their papers we have counts for
4 papers · 1 filter
List edge-colouring and total colouring in graphs of low treewidth
Henning Bruhn, Richard Lang, Maya Stein
We prove that the list chromatic index of a graph of maximum degree and treewidth is ; and that the total chromatic number of a graph of maximum degree $…
Claw-free t-perfect graphs can be recognised in polynomial time
Henning Bruhn, Oliver Schaudt
A graph is called t-perfect if its stable set polytope is defined by non-negativity, edge and odd-cycle inequalities. We show that it can be decided in polynomial time whether a gi…
The journey of the union-closed sets conjecture
Henning Bruhn, Oliver Schaudt
We survey the state of the union-closed sets conjecture.
The union-closed sets conjecture almost holds for almost all random bipartite graphs
Henning Bruhn, Oliver Schaudt
Frankl's union-closed sets conjecture states that in every finite union-closed set of sets, there is an element that is contained in at least half of the member-sets (provided ther…