H. Bruhn

activity

20092026

most citedAxioms for infinite matroids

19 citations · 41 across the 26 of their papers we have counts for

collaborators

Showing 2015Show all

4 papers · 1 filter

math.CO2015★ 2 cited

$h$ -perfect plane triangulations

Yohann Benchetrit, Henning Bruhn

We characterise $t$ -perfect plane triangulations by forbidden induced subgraphs. As a consequence, we obtain that a plane triangulation is $h$ -perfect if and only if it is perfect.

math.CO2015

$t$ -perfection in $P_{5}$ -free graphs

Henning Bruhn, Elke Fuchs

A graph is called $t$ -perfect if its stable set polytope is fully described by non-negativity, edge and odd-cycle constraints. We characterise $P_{5}$ -free $t$ -perfect graphs in term…

math.CO2015

A stronger bound for the strong chromatic index

Henning Bruhn, Felix Joos

We prove $χ_{s}^{'} (G) \leq 1.93Δ (G)^{2}$ for graphs of sufficiently large maximum degree where $χ_{s}^{'} (G)$ is the strong chromatic index of $G$ . This improves an old bound of Molloy and Re…

math.CO2015

Jacobsthal numbers in generalised Petersen graphs

Henning Bruhn, Laura Gellert, Jacob Günther

We prove that the number of $1$ -factorisations of a generalised Petersen graph of the type $GP (3 k, k)$ is equal to the $k$ th Jacobsthal number $J (k)$ if $k$ is odd, and equal to $4J…

h-perfect plane triangulations

t-perfection in P5​-free graphs

A stronger bound for the strong chromatic index

Jacobsthal numbers in generalised Petersen graphs

$h$ -perfect plane triangulations

$t$ -perfection in $P_{5}$ -free graphs