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.
70 Publications
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.