19 citations · 41 across the 26 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011
Colouring stability two unit disk graphs
Henning Bruhn
We prove that every stability two unit disk graph has chromatic number at most 3/2 times its clique number.
math.CO2011★ 1 cited
Finite connectivity in infinite matroids
Henning Bruhn, Paul Wollan
We introduce a connectivity function for infinite matroids with properties similar to the connectivity function of a finite matroid, such as submodularity and invariance under dual…