Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
103 Publications
2010 | Journal Article | LibreCat-ID: 10174
Steffen, E. (2010). Tutte’s 5-flow conjecture for cyclically highly connected cubic graphs. Discrete Mathematics, 310, 385–389.
LibreCat
2010 | Preprint | LibreCat-ID: 10202
Mkrtchyan, V., & Steffen, E. (2010). Bricks and conjectures of Berge, Fulkerson and Seymour. ArXiv:1003.5782.
LibreCat
2008 | Journal Article | LibreCat-ID: 10175
Mohar, B., Steffen, E., & Vodopivec, A. (2008). Relating embedding and coloring properties of snarks. Ars Mathematica Contemporanea, 1, 169–184.
LibreCat
2006 | Journal Article | LibreCat-ID: 10176
Boben, M., Pisanski, T., Ravnik, N., & Steffen, E. (2006). Erratum to „Reductions of Symmetry configurations n3. Discrete Applied Mathematics, 154(11), 1645–1646.
LibreCat
2004 | Journal Article | LibreCat-ID: 10177
Steffen, E. (2004). Measurements of edge-uncolorability. Discrete Mathematics, 280, 191–214.
LibreCat
2004 | Journal Article | LibreCat-ID: 10178
Grünewald, S., & Steffen, E. (2004). Independent Sets and 2-factors in edge-chromatic critical graphs. J. Graph Theory, 45, 113–118.
LibreCat
2001 | Journal Article | LibreCat-ID: 10179
Steffen, E. (2001). Circular flow numbers of regular multigraphs. J. Graph Theory, 36, 24–34.
LibreCat
2001 | Journal Article | LibreCat-ID: 10180
Steffen, E. (2001). On bicritical snarks. Math. Slovaca, 51, 141–150.
LibreCat
2000 | Journal Article | LibreCat-ID: 10182
Brinkmann, G., Choudum, S. A., Grünewald, S., & Steffen, E. (2000). Bounds for the independence number of critical graphs. Bull. London Math. Soc., 32, 137–140.
LibreCat
2000 | Journal Article | LibreCat-ID: 10183
Steffen, E. (2000). A refinement of Vizing’s theorem. Discrete Mathematics, 218, 289–291.
LibreCat
2000 | Journal Article | LibreCat-ID: 10186
Carstens, H. G., Dinski, T., & Steffen, E. (2000). Reductions of Symmetry configurations n3. Discrete Applied Mathematics, 99, 401–411.
LibreCat
1999 | Journal Article | LibreCat-ID: 10187
Steffen, E. (1999). Counterexamples to a conjecture about Petersen-minors in supersnarks. Discrete Mathematics, 207, 291–292.
LibreCat
1999 | Journal Article | LibreCat-ID: 10189
Steffen, E. (1999). Non-bicritical critical snarks. Graphs Comb., 15, 473–480.
LibreCat
1999 | Journal Article | LibreCat-ID: 10190
Grünewald, S., & Steffen, E. (1999). Cyclically 5-edge connected non-bicritical critical snarks. Discuss. Math. Graph Theory, 19, 5–11.
LibreCat
1999 | Journal Article | LibreCat-ID: 10191
Grünewald, S., & Steffen, E. (1999). Chromatic-index-critical graphs of even order. J. Graph Theory, 30, 27–36.
LibreCat
1998 | Journal Article | LibreCat-ID: 10193
Brinkmann, G., & Steffen, E. (1998). Snarks and reducibility. Ars Combinatoria, 50, 292–296.
LibreCat
1998 | Journal Article | LibreCat-ID: 10194
Brinkmann, G., & Steffen, E. (1998). Chromatic-index-critical graphs of Orders 11 and 12. European J. Combinatorics, 19, 889–900.
LibreCat
1998 | Journal Article | LibreCat-ID: 10195
Steffen, E. (1998). Classification and characterizations of snarkse. Discrete Mathematics, 188, 183-203 (.
LibreCat
1997 | Journal Article | LibreCat-ID: 10196
Brinkmann, G., & Steffen, E. (1997). 3- and 4-critical graphs of small even order. Discrete Mathematics, 188, 193–197.
LibreCat
1996 | Journal Article | LibreCat-ID: 10197
Steffen, E. (1996). Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs. Discrete Mathematics, 161, 315.
LibreCat