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 2023Show all

3 papers · 1 filter

math.CO2023

Sets of $r$ -graphs that color all $r$ -graphs

Yulai Ma, Davide Mattiolo, Eckhard Steffen +1

An $r$ -regular graph is an $r$ -graph, if every odd set of vertices is connected to its complement by at least $r$ edges. Let $G$ and $H$ be $r$ -graphs. An $H$ -coloring of $G$ is a…

math.CO2023

Rotation $r$ -graphs

Eckhard Steffen, Isaak H. Wolf

We study rotation $r$ -graphs and show that for every $r$ -graph $G$ of odd regularity there is a simple rotation $r$ -graph $G^{'}$ such that $G$ can be obtained form $G^{'}$ by a finite n…

math.CO2023

Critically 3-frustrated signed graphs

Chiara Cappello, Reza Naserasr, Eckhard Steffen +1

Extending the notion of maxcut, the study of the frustration index of signed graphs is one of the basic questions in the theory of signed graphs. Recently two of the authors initia…

Sets of r-graphs that color all r-graphs

Rotation r-graphs

Critically 3-frustrated signed graphs

Sets of $r$ -graphs that color all $r$ -graphs

Rotation $r$ -graphs