@article{10162,
  author       = {{Steffen, Eckhard}},
  journal      = {{Combinatorica}},
  pages        = {{633--640}},
  title        = {{{Intersecting 1-factors and nowhere-zero 5-flows}}},
  volume       = {{35}},
  year         = {{2015}},
}

@article{10163,
  author       = {{Steffen, Eckhard}},
  journal      = {{J. Graph Theory}},
  pages        = {{1--7}},
  title        = {{{Edge-colorings and circular flow numbers of regular graphs}}},
  volume       = {{79}},
  year         = {{2015}},
}

@article{10164,
  author       = {{Máčajová, Edita and Steffen, Eckhard}},
  journal      = {{Discrete Mathematics}},
  pages        = {{866--867}},
  title        = {{{The difference between the circular and the integer flow number of bidirected graphs}}},
  volume       = {{338}},
  year         = {{2015}},
}

@article{10165,
  author       = {{Steffen, Eckhard}},
  journal      = {{J. Graph Theory}},
  number       = {{3}},
  pages        = {{195 – 206}},
  title        = {{{1-factor-and cycle covers of cubic graphs}}},
  volume       = {{78}},
  year         = {{2015}},
}

@article{10166,
  author       = {{Schubert, Michael and Steffen, Eckhard}},
  journal      = {{European J. Combinatorics}},
  pages        = {{34--47}},
  title        = {{{Nowhere-zero flows on signed regular graphs}}},
  volume       = {{48}},
  year         = {{2015}},
}

@article{10167,
  author       = {{Schubert, Michael and Steffen, Eckhard}},
  journal      = {{J. Graph Theory}},
  pages        = {{297--308}},
  title        = {{{The set of circular flow numbers of regular graphs}}},
  volume       = {{76}},
  year         = {{2014}},
}

@article{10169,
  author       = {{Hägglund, Jonas and Steffen, Eckhard}},
  journal      = {{Ars Mathematica Contemporanea}},
  pages        = {{476--478}},
  title        = {{{Petersen colorings and some families of snarks}}},
  volume       = {{312}},
  year         = {{2014}},
}

@article{10170,
  author       = {{Brinkmann, Gunnar and Crevals,  Simon and Melot, Hadrien and Rylands,  Leanne J. and Steffen, Eckhard}},
  journal      = {{Discrete Mathematics. and Theoretical Computer Science}},
  pages        = {{159--174}},
  title        = {{{α-labelings and the structure of trees with nonzero α-deficit }}},
  volume       = {{14.1}},
  year         = {{2012}},
}

@article{10171,
  author       = {{Steffen, Eckhard}},
  journal      = {{Discrete Mathematics}},
  pages        = {{2757--2759}},
  title        = {{{Nearly nowhere-zero r-flow graphs}}},
  volume       = {{312}},
  year         = {{2012}},
}

@article{10172,
  author       = {{Mkrtchyan, Vahan and Steffen, Eckhard}},
  journal      = {{J. Graph Theory}},
  pages        = {{473--482}},
  title        = {{{Maximum Δ-edge-colorable subgraphs of class II graphs}}},
  volume       = {{70}},
  year         = {{2012}},
}

@article{10173,
  author       = {{Mkrtchyan, Vahan and Steffen, Eckhard}},
  journal      = {{Discrete Mathematics}},
  pages        = {{476--478}},
  title        = {{{Measures of edge-uncolorability}}},
  volume       = {{312}},
  year         = {{2012}},
}

@article{10174,
  author       = {{Steffen, Eckhard}},
  journal      = {{Discrete Mathematics}},
  pages        = {{385 -- 389}},
  title        = {{{Tutte's 5-flow conjecture for cyclically highly connected cubic graphs}}},
  volume       = {{310}},
  year         = {{2010}},
}

@unpublished{10202,
  abstract     = {{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$-edge-colorable, and also that any $r$-graph
contains $2r$ perfect matchings such that each edge belongs to two of them. We
show that the minimum counter-example to either of these conjectures is a
brick. Furthermore we disprove a variant of a conjecture of Fan, Raspaud.}},
  author       = {{Mkrtchyan, Vahan and Steffen, Eckhard}},
  booktitle    = {{arXiv:1003.5782}},
  title        = {{{Bricks and conjectures of Berge, Fulkerson and Seymour}}},
  year         = {{2010}},
}

@article{10175,
  author       = {{Mohar, Bojan and Steffen, Eckhard and Vodopivec, Andrej}},
  journal      = {{Ars Mathematica Contemporanea}},
  pages        = {{169--184}},
  title        = {{{Relating embedding and coloring properties of snarks}}},
  volume       = {{1}},
  year         = {{2008}},
}

@article{10176,
  author       = {{Boben, Marco and Pisanski, Tomaž  and Ravnik, Natasa and Steffen, Eckhard}},
  journal      = {{Discrete Applied Mathematics}},
  number       = {{11}},
  pages        = {{1645 --1646}},
  title        = {{{Erratum to „Reductions of Symmetry configurations n3}}},
  volume       = {{154}},
  year         = {{2006}},
}

@article{10177,
  author       = {{Steffen, Eckhard}},
  journal      = {{Discrete Mathematics}},
  pages        = {{191 -- 214}},
  title        = {{{Measurements of edge-uncolorability}}},
  volume       = {{280}},
  year         = {{2004}},
}

@article{10178,
  author       = {{Grünewald, Stefan and Steffen, Eckhard}},
  journal      = {{J. Graph Theory}},
  pages        = {{113 --118}},
  title        = {{{Independent Sets and 2-factors in edge-chromatic critical graphs}}},
  volume       = {{45}},
  year         = {{2004}},
}

@article{10179,
  author       = {{Steffen, Eckhard}},
  journal      = {{J. Graph Theory}},
  pages        = {{24 -- 34}},
  title        = {{{Circular flow numbers of regular multigraphs}}},
  volume       = {{36}},
  year         = {{2001}},
}

@article{10180,
  author       = {{Steffen, Eckhard}},
  journal      = {{Math. Slovaca}},
  pages        = {{141 --150}},
  title        = {{{On bicritical snarks}}},
  volume       = {{51}},
  year         = {{2001}},
}

@article{10182,
  author       = {{Brinkmann, Gunnar and Choudum, Sheshayya A and Grünewald, Stefan and Steffen, Eckhard}},
  journal      = {{Bull. London Math. Soc.}},
  pages        = {{137 --140}},
  title        = {{{Bounds for the independence number of critical graphs}}},
  volume       = {{32}},
  year         = {{2000}},
}