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 2010 · cs.DMShow all

3 papers · 2 filters

cs.DM2010★ 1 cited

Bricks and conjectures of Berge, Fulkerson and Seymour

Vahan Mkrtchyan, Eckhard Steffen

An $r$ -graph is an $r$ -regular graph where every odd set of vertices is connected by at least $r$ edges to the rest of the graph. Seymour conjectured that any $r$ -graph is $r + 1$ -ed…

cs.DM2010★ 3 cited

Measures of edge-uncolorability

Vahan Mkrtchyan, Eckhard Steffen

The resistance $r (G)$ of a graph $G$ is the minimum number of edges that have to be removed from $G$ to obtain a graph which is $Δ (G)$ -edge-colorable. The paper relates the resista…

cs.DM2010★ 11 cited

Maximum $Δ$ -edge-colorable subgraphs of class II graphs

Vahan V. Mkrtchyan, Eckhard Steffen

A graph $G$ is class II, if its chromatic index is at least $Δ + 1$ . Let $H$ be a maximum $Δ$ -edge-colorable subgraph of $G$ . The paper proves best possible lower bounds for $\frac{|…

Bricks and conjectures of Berge, Fulkerson and Seymour

Measures of edge-uncolorability

Maximum Δ-edge-colorable subgraphs of class II graphs

Maximum $Δ$ -edge-colorable subgraphs of class II graphs