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.
69 Publications
2004 | Journal Article | LibreCat-ID: 10177
Measurements of edge-uncolorability
E. Steffen, Discrete Mathematics 280 (2004) 191–214.
LibreCat
E. Steffen, Discrete Mathematics 280 (2004) 191–214.
2004 | Journal Article | LibreCat-ID: 10178
Independent Sets and 2-factors in edge-chromatic critical graphs
S. Grünewald, E. Steffen, J. Graph Theory 45 (2004) 113–118.
LibreCat
S. Grünewald, E. Steffen, J. Graph Theory 45 (2004) 113–118.
2001 | Journal Article | LibreCat-ID: 10179
Circular flow numbers of regular multigraphs
E. Steffen, J. Graph Theory 36 (2001) 24–34.
LibreCat
E. Steffen, J. Graph Theory 36 (2001) 24–34.
2001 | Journal Article | LibreCat-ID: 10180
On bicritical snarks
E. Steffen, Math. Slovaca 51 (2001) 141–150.
LibreCat
E. Steffen, Math. Slovaca 51 (2001) 141–150.
2000 | Journal Article | LibreCat-ID: 10182
Bounds for the independence number of critical graphs
G. Brinkmann, S.A. Choudum, S. Grünewald, E. Steffen, Bull. London Math. Soc. 32 (2000) 137–140.
LibreCat
G. Brinkmann, S.A. Choudum, S. Grünewald, E. Steffen, Bull. London Math. Soc. 32 (2000) 137–140.
2000 | Journal Article | LibreCat-ID: 10183
A refinement of Vizing's theorem
E. Steffen, Discrete Mathematics 218 (2000) 289–291.
LibreCat
E. Steffen, Discrete Mathematics 218 (2000) 289–291.
2000 | Journal Article | LibreCat-ID: 10186
Reductions of Symmetry configurations n3
H.G. Carstens, T. Dinski, E. Steffen, Discrete Applied Mathematics 99 (2000) 401–411.
LibreCat
H.G. Carstens, T. Dinski, E. Steffen, Discrete Applied Mathematics 99 (2000) 401–411.
1999 | Journal Article | LibreCat-ID: 10187
Counterexamples to a conjecture about Petersen-minors in supersnarks
E. Steffen, Discrete Mathematics 207 (1999) 291–292.
LibreCat
E. Steffen, Discrete Mathematics 207 (1999) 291–292.
1999 | Journal Article | LibreCat-ID: 10189
Non-bicritical critical snarks
E. Steffen, Graphs Comb. 15 (1999) 473–480.
LibreCat
E. Steffen, Graphs Comb. 15 (1999) 473–480.
1999 | Journal Article | LibreCat-ID: 10190
Cyclically 5-edge connected non-bicritical critical snarks
S. Grünewald, E. Steffen, Discuss. Math. Graph Theory 19 (1999) 5–11.
LibreCat
S. Grünewald, E. Steffen, Discuss. Math. Graph Theory 19 (1999) 5–11.
1999 | Journal Article | LibreCat-ID: 10191
Chromatic-index-critical graphs of even order
S. Grünewald, E. Steffen, J. Graph Theory 30 (1999) 27–36.
LibreCat
S. Grünewald, E. Steffen, J. Graph Theory 30 (1999) 27–36.
1998 | Journal Article | LibreCat-ID: 10193
Snarks and reducibility
G. Brinkmann, E. Steffen, Ars Combinatoria 50 (1998) 292–296.
LibreCat
G. Brinkmann, E. Steffen, Ars Combinatoria 50 (1998) 292–296.
1998 | Journal Article | LibreCat-ID: 10194
Chromatic-index-critical graphs of Orders 11 and 12
G. Brinkmann, E. Steffen, European J. Combinatorics 19 (1998) 889–900.
LibreCat
G. Brinkmann, E. Steffen, European J. Combinatorics 19 (1998) 889–900.
1998 | Journal Article | LibreCat-ID: 10195
Classification and characterizations of snarkse
E. Steffen, Discrete Mathematics 188 (1998) 183-203 (.
LibreCat
E. Steffen, Discrete Mathematics 188 (1998) 183-203 (.
1997 | Journal Article | LibreCat-ID: 10196
3- and 4-critical graphs of small even order
G. Brinkmann, E. Steffen, Discrete Mathematics 188 (1997) 193–197.
LibreCat
G. Brinkmann, E. Steffen, Discrete Mathematics 188 (1997) 193–197.
1996 | Journal Article | LibreCat-ID: 10197
Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs
E. Steffen, Discrete Mathematics 161 (1996) 315.
LibreCat
E. Steffen, Discrete Mathematics 161 (1996) 315.
1996 | Journal Article | LibreCat-ID: 10198
Star chromatic numbers of graphs
E. Steffen, X. Zhu, Combinatorica 16 (1996) 439–448.
LibreCat
E. Steffen, X. Zhu, Combinatorica 16 (1996) 439–448.
1996 | Journal Article | LibreCat-ID: 10199
Tutte's 5-flow conjecture for graphs of non-orientable genus 5
E. Steffen, J. Graph Theory 22 (1996) 309–319.
LibreCat
E. Steffen, J. Graph Theory 22 (1996) 309–319.
1992 | Conference Paper | LibreCat-ID: 10201
Complexity results for the default- and autoepistemic logic
E. Steffen, in: E. Börger (Ed.), Computer Science Logic , Springer Berlin Heidelberg, 1992, pp. 339–352.
LibreCat
E. Steffen, in: E. Börger (Ed.), Computer Science Logic , Springer Berlin Heidelberg, 1992, pp. 339–352.