E. Steffen

activity

20062025

most cited1-factor and cycle covers of cubic graphs

43 citations · 166 across the 37 of their papers we have counts for

collaborators

Showing 2022Show all

3 papers · 1 filter

math.CO2022

Edge-connectivity and pairwise disjoint perfect matchings in regular graphs

Yulai Ma, Davide Mattiolo, Eckhard Steffen +1

For $0 \leq t \leq r$ let $m (t, r)$ be the maximum number $s$ such that every $t$ -edge-connected $r$ -graph has $s$ pairwise disjoint perfect matchings. There are only a few values o…

math.CO2022

Bounds for the chromatic index of signed multigraphs

Eckhard Steffen, Isaak H. Wolf

The paper studies edge-coloring of signed multigraphs and extends classical Theorems of Shannon and König to signed multigraphs. We prove that the chromatic index of a signed multi…

math.CO2022★ 5 cited

Pairwise disjoint perfect matchings in $r$ -edge-connected $r$ -regular graphs

Yulai Ma, Davide Mattiolo, Eckhard Steffen +1

Thomassen [Problem 1 in Factorizing regular graphs, J. Combin. Theory Ser. B, 141 (2020), 343-351] asked whether every $r$ -edge-connected $r$ -regular graph of even order has $r - 2$ …

Edge-connectivity and pairwise disjoint perfect matchings in regular graphs

Bounds for the chromatic index of signed multigraphs

Pairwise disjoint perfect matchings in r-edge-connected r-regular graphs

Pairwise disjoint perfect matchings in $r$ -edge-connected $r$ -regular graphs