53 Publications

Mark all

[53]
2019 | Journal Article | LibreCat-ID: 12971
L. Jin and E. Steffen, “Unions of 1-factors in r-graphs and overfull graphs,” J. of Combinatorics, to appear, 2019.
LibreCat
 
[52]
2019 | Preprint | LibreCat-ID: 13114
Y. Lu, R. Luo, M. Schubert, E. Steffen, and C.-Q. Zhang, “Flows on signed graphs without long barbells,” arXiv:1908.11004. 2019.
LibreCat
 
[51]
2019 | Preprint | LibreCat-ID: 15445
D. Mattiolo and E. Steffen, “Highly edge-connected regular graphs without large factorizable  subgraphs,” arXiv:1912.09704. 2019.
LibreCat
 
[50]
2019 | Preprint | LibreCat-ID: 13445
E. Steffen and A. Vogel, “Concepts of signed graph coloring,” arXiv:1909.09381. 2019.
LibreCat
 
[49]
2019 | Preprint | LibreCat-ID: 12970
A. Klopp and E. Steffen, “Fractional matchings and component-factors of (edge-chromatic critical)  graphs,” arXiv:1903.12385. 2019.
LibreCat
 
[48]
2018 | Journal Article | LibreCat-ID: 10142
E. Steffen, “Approximating Vizing’s independence number conjecture,” Australasian Journal of Combinatorics, vol. 71, no. 1, pp. 153–160, 2018.
LibreCat
 
[47]
2018 | Journal Article | LibreCat-ID: 10130
E. Rollová, M. Schubert, and E. Steffen, “Signed Graphs with Two Negative Edges ,” Electronic Journal of Combinatorics, vol. 25, no. 2, 2018.
LibreCat
 
[46]
2018 | Journal Article | LibreCat-ID: 10129
M. A. Fiol, G. Mazzuoccolo, and E. Steffen, “Measures of Edge-Uncolorability of Cubic Graphs,” The Electronic Journal of Combinatorics, vol. 25, no. 4, 2018.
LibreCat
 
[45]
2018 | Journal Article | LibreCat-ID: 10132
L. Jin, G. Mazzuoccolo, and E. Steffen, “Cores, joins  and the Fano-flow conjectures,” Discussiones Mathematicae Graph Theory, vol. 38, pp. 165–175, 2018.
LibreCat | DOI
 
[44]
2017 | Book (Editor) | LibreCat-ID: 10146
G. W. Maier, G. Engels, and E. Steffen, Eds., Handbuch Gestaltung digitaler und vernetzter Arbeitswelten, 1st ed. Springer Berlin Heidelberg, 2017.
LibreCat
 
[43]
2017 | Book Chapter | LibreCat-ID: 10147
D. Simon and E. Steffen, “Digitale Zukunft: ein inter- und transdisziplinäres Thema,” in Handbuch Gestaltung digitaler und vernetzter Arbeitswelten, 1st ed., G. W. Maier, G. Engels, and E. Steffen, Eds. Springer Berlin Heidelberg, 2017, pp. 1–12.
LibreCat
 
[42]
2017 | Book Chapter | LibreCat-ID: 10143
G. Engels, G. W. Maier, S. K. Ötting, E. Steffen, and A. Teetz, “Gerechtigkeit in flexiblen Arbeits- und Managementprozessen,” in Zukunft der Arbeit – Eine praxsnahe Betrachtung, S. Wischmann and E. A. Hartmann, Eds. Springer Vieweg, 2017, pp. 221–231.
LibreCat
 
[41]
2017 | Journal Article | LibreCat-ID: 10155
G. Mazzuoccolo and E. Steffen, “Nowhere-zero 5-flows on cubic graphs with oddness 4,” J. Graph Theory, vol. 85, pp. 363 – 371, 2017.
LibreCat
 
[40]
2017 | Journal Article | LibreCat-ID: 10156
S. Bej and E. Steffen, “Factors of edge-chromatic critical graphs: a brief survey and some equivalences,” Lecture Notes of Seminario Interdisciplinare di Matematica, vol. 14, pp. 37–48, 2017.
LibreCat
 
[39]
2017 | Journal Article | LibreCat-ID: 10157
L. Jin and E. Steffen, “Petersen cores and the oddness of cubic graphs,” J. Graph Theory, vol. 84, pp. 109–120, 2017.
LibreCat
 
[38]
2016 | Journal Article | LibreCat-ID: 10158
L. Jin, Y. Kang, and E. Steffen, “Face-degree bounds for planar critical graphs,” Electronic Journal of Combinatorics, vol. 23, no. 3, 2016.
LibreCat
 
[37]
2016 | Journal Article | LibreCat-ID: 10160
L. Jin, Y. Kang, and E. Steffen, “Remarks on planar critical graphs,” Discrete Applied Mathematics, vol. 200, pp. 200–202, 2016.
LibreCat
 
[36]
2016 | Journal Article | LibreCat-ID: 10161
L. Jin, Y. Kang, and E. Steffen, “Choosability in signed planar graphs,” European J. Combinatorics, vol. 52, pp. 234–243, 2016.
LibreCat
 
[35]
2016 | Journal Article | LibreCat-ID: 10159
Y. Kang and E. Steffen, “The chromatic spectrum of signed graphs,” Discrete Mathematics , vol. 339, pp. 234–243, 2016.
LibreCat
 
[34]
2015 | Journal Article | LibreCat-ID: 10165
E. Steffen, “1-factor-and cycle covers of cubic graphs,” J. Graph Theory, vol. 78, no. 3, pp. 195 – 206, 2015.
LibreCat
 
[33]
2015 | Journal Article | LibreCat-ID: 10166
M. Schubert and E. Steffen, “Nowhere-zero flows on signed regular graphs,” European J. Combinatorics, vol. 48, pp. 34–47, 2015.
LibreCat
 
[32]
2015 | Journal Article | LibreCat-ID: 10162
E. Steffen, “Intersecting 1-factors and nowhere-zero 5-flows,” Combinatorica, vol. 35, pp. 633–640, 2015.
LibreCat
 
[31]
2015 | Journal Article | LibreCat-ID: 10163
E. Steffen, “Edge-colorings and circular flow numbers of regular graphs,” J. Graph Theory, vol. 79, pp. 1–7, 2015.
LibreCat
 
[30]
2015 | Journal Article | LibreCat-ID: 10164
E. Máčajová and E. Steffen, “The difference between the circular and the integer flow number of bidirected graphs,” Discrete Mathematics, vol. 338, pp. 866–867, 2015.
LibreCat
 
[29]
2014 | Journal Article | LibreCat-ID: 10167
M. Schubert and E. Steffen, “The set of circular flow numbers of regular graphs,” J. Graph Theory, vol. 76, pp. 297–308, 2014.
LibreCat
 
[28]
2014 | Journal Article | LibreCat-ID: 10169
J. Hägglund and E. Steffen, “Petersen colorings and some families of snarks,” Ars Mathematica Contemporanea, vol. 312, pp. 476–478, 2014.
LibreCat
 
[27]
2012 | Journal Article | LibreCat-ID: 10172
V. Mkrtchyan and E. Steffen, “Maximum Δ-edge-colorable subgraphs of class II graphs,” J. Graph Theory, vol. 70, pp. 473–482, 2012.
LibreCat
 
[26]
2012 | Journal Article | LibreCat-ID: 10173
V. Mkrtchyan and E. Steffen, “Measures of edge-uncolorability,” Discrete Mathematics, vol. 312, pp. 476–478, 2012.
LibreCat
 
[25]
2012 | Journal Article | LibreCat-ID: 10170
G. Brinkmann, Simon Crevals, H. Melot, Leanne J. Rylands, and E. Steffen, “α-labelings and the structure of trees with nonzero α-deficit ,” Discrete Mathematics. and Theoretical Computer Science, vol. 14.1, pp. 159–174, 2012.
LibreCat
 
[24]
2012 | Journal Article | LibreCat-ID: 10171
E. Steffen, “Nearly nowhere-zero r-flow graphs,” Discrete Mathematics, vol. 312, pp. 2757–2759, 2012.
LibreCat
 
[23]
2010 | Journal Article | LibreCat-ID: 10174
E. Steffen, “Tutte’s 5-flow conjecture for cyclically highly connected cubic graphs,” Discrete Mathematics, vol. 310, pp. 385–389, 2010.
LibreCat
 
[22]
2010 | Preprint | LibreCat-ID: 10202
V. Mkrtchyan and E. Steffen, “Bricks and conjectures of Berge, Fulkerson and Seymour,” arXiv:1003.5782. 2010.
LibreCat
 
[21]
2008 | Journal Article | LibreCat-ID: 10175
B. Mohar and E. Steffen, “Relating embedding and coloring properties of snarks,” Ars Mathematica Contemporanea, vol. 1, pp. 169–184, 2008.
LibreCat
 
[20]
2006 | Journal Article | LibreCat-ID: 10176
M. Boben, T. Pisanski, N. Ravnik, and E. Steffen, “Erratum to „Reductions of Symmetry configurations n3,” Discrete Applied Mathematics, vol. 154, no. 11, pp. 1645–1646, 2006.
LibreCat
 
[19]
2004 | Journal Article | LibreCat-ID: 10177
E. Steffen, “Measurements of edge-uncolorability,” Discrete Mathematics, vol. 280, pp. 191–214, 2004.
LibreCat
 
[18]
2004 | Journal Article | LibreCat-ID: 10178
S. Grünewald and E. Steffen, “Independent Sets and 2-factors in edge-chromatic critical graphs,” J. Graph Theory, vol. 45, pp. 113–118, 2004.
LibreCat
 
[17]
2001 | Journal Article | LibreCat-ID: 10180
E. Steffen, “On bicritical snarks,” Math. Slovaca, vol. 51, pp. 141–150, 2001.
LibreCat
 
[16]
2001 | Journal Article | LibreCat-ID: 10179
E. Steffen, “Circular flow numbers of regular multigraphs,” J. Graph Theory, vol. 36, pp. 24–34, 2001.
LibreCat
 
[15]
2000 | Journal Article | LibreCat-ID: 10186
H. G. Carstens, T. Dinski, and E. Steffen, “Reductions of Symmetry configurations n3,” Discrete Applied Mathematics, vol. 99, pp. 401–411, 2000.
LibreCat
 
[14]
2000 | Journal Article | LibreCat-ID: 10182
G. Brinkmann, S. A. Choudum, S. Grünewald, and E. Steffen, “Bounds for the independence number of critical graphs,” Bull. London Math. Soc., vol. 32, pp. 137–140, 2000.
LibreCat
 
[13]
2000 | Journal Article | LibreCat-ID: 10183
E. Steffen, “A refinement of Vizing’s theorem,” Discrete Mathematics, vol. 218, pp. 289–291, 2000.
LibreCat
 
[12]
1999 | Journal Article | LibreCat-ID: 10191
S. Grünewald and E. Steffen, “Chromatic-index-critical graphs of even order,” J. Graph Theory, vol. 30, pp. 27–36, 1999.
LibreCat
 
[11]
1999 | Journal Article | LibreCat-ID: 10189
E. Steffen, “Non-bicritical critical snarks,” Graphs Comb., vol. 15, pp. 473–480, 1999.
LibreCat
 
[10]
1999 | Journal Article | LibreCat-ID: 10187
E. Steffen, “Counterexamples to a conjecture about Petersen-minors in supersnarks,” Discrete Mathematics, vol. 207, pp. 291–292, 1999.
LibreCat
 
[9]
1999 | Journal Article | LibreCat-ID: 10190
S. Grünewald and E. Steffen, “Cyclically 5-edge connected non-bicritical critical snarks,” Discuss. Math. Graph Theory, vol. 19, pp. 5–11, 1999.
LibreCat
 
[8]
1998 | Journal Article | LibreCat-ID: 10193
G. Brinkmann and E. Steffen, “Snarks and reducibility,” Ars Combinatoria, vol. 50, pp. 292–296, 1998.
LibreCat
 
[7]
1998 | Journal Article | LibreCat-ID: 10194
G. Brinkmann and E. Steffen, “Chromatic-index-critical graphs of Orders 11 and 12,” European J. Combinatorics, vol. 19, pp. 889–900, 1998.
LibreCat
 
[6]
1998 | Journal Article | LibreCat-ID: 10195
E. Steffen, “Classification and characterizations of snarkse,” Discrete Mathematics, vol. 188, pp. 183-203 (, 1998.
LibreCat
 
[5]
1997 | Journal Article | LibreCat-ID: 10196
G. Brinkmann and E. Steffen, “3- and 4-critical graphs of small even order,” Discrete Mathematics, vol. 188, pp. 193–197, 1997.
LibreCat
 
[4]
1996 | Journal Article | LibreCat-ID: 10197
E. Steffen, “Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs,” Discrete Mathematics, vol. 161, p. 315, 1996.
LibreCat
 
[3]
1996 | Journal Article | LibreCat-ID: 10198
E. Steffen and X. Zhu, “Star chromatic numbers of graphs,” Combinatorica, vol. 16, pp. 439–448, 1996.
LibreCat
 
[2]
1996 | Journal Article | LibreCat-ID: 10199
E. Steffen, “Tutte’s 5-flow conjecture for graphs of non-orientable genus 5,” J. Graph Theory, vol. 22, pp. 309–319, 1996.
LibreCat
 
[1]
1992 | Conference Paper | LibreCat-ID: 10201
E. Steffen, “Complexity results for the default- and autoepistemic logic,” in Computer Science Logic , 1992, vol. 626, pp. 339–352.
LibreCat
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed

53 Publications

Mark all

[53]
2019 | Journal Article | LibreCat-ID: 12971
L. Jin and E. Steffen, “Unions of 1-factors in r-graphs and overfull graphs,” J. of Combinatorics, to appear, 2019.
LibreCat
 
[52]
2019 | Preprint | LibreCat-ID: 13114
Y. Lu, R. Luo, M. Schubert, E. Steffen, and C.-Q. Zhang, “Flows on signed graphs without long barbells,” arXiv:1908.11004. 2019.
LibreCat
 
[51]
2019 | Preprint | LibreCat-ID: 15445
D. Mattiolo and E. Steffen, “Highly edge-connected regular graphs without large factorizable  subgraphs,” arXiv:1912.09704. 2019.
LibreCat
 
[50]
2019 | Preprint | LibreCat-ID: 13445
E. Steffen and A. Vogel, “Concepts of signed graph coloring,” arXiv:1909.09381. 2019.
LibreCat
 
[49]
2019 | Preprint | LibreCat-ID: 12970
A. Klopp and E. Steffen, “Fractional matchings and component-factors of (edge-chromatic critical)  graphs,” arXiv:1903.12385. 2019.
LibreCat
 
[48]
2018 | Journal Article | LibreCat-ID: 10142
E. Steffen, “Approximating Vizing’s independence number conjecture,” Australasian Journal of Combinatorics, vol. 71, no. 1, pp. 153–160, 2018.
LibreCat
 
[47]
2018 | Journal Article | LibreCat-ID: 10130
E. Rollová, M. Schubert, and E. Steffen, “Signed Graphs with Two Negative Edges ,” Electronic Journal of Combinatorics, vol. 25, no. 2, 2018.
LibreCat
 
[46]
2018 | Journal Article | LibreCat-ID: 10129
M. A. Fiol, G. Mazzuoccolo, and E. Steffen, “Measures of Edge-Uncolorability of Cubic Graphs,” The Electronic Journal of Combinatorics, vol. 25, no. 4, 2018.
LibreCat
 
[45]
2018 | Journal Article | LibreCat-ID: 10132
L. Jin, G. Mazzuoccolo, and E. Steffen, “Cores, joins  and the Fano-flow conjectures,” Discussiones Mathematicae Graph Theory, vol. 38, pp. 165–175, 2018.
LibreCat | DOI
 
[44]
2017 | Book (Editor) | LibreCat-ID: 10146
G. W. Maier, G. Engels, and E. Steffen, Eds., Handbuch Gestaltung digitaler und vernetzter Arbeitswelten, 1st ed. Springer Berlin Heidelberg, 2017.
LibreCat
 
[43]
2017 | Book Chapter | LibreCat-ID: 10147
D. Simon and E. Steffen, “Digitale Zukunft: ein inter- und transdisziplinäres Thema,” in Handbuch Gestaltung digitaler und vernetzter Arbeitswelten, 1st ed., G. W. Maier, G. Engels, and E. Steffen, Eds. Springer Berlin Heidelberg, 2017, pp. 1–12.
LibreCat
 
[42]
2017 | Book Chapter | LibreCat-ID: 10143
G. Engels, G. W. Maier, S. K. Ötting, E. Steffen, and A. Teetz, “Gerechtigkeit in flexiblen Arbeits- und Managementprozessen,” in Zukunft der Arbeit – Eine praxsnahe Betrachtung, S. Wischmann and E. A. Hartmann, Eds. Springer Vieweg, 2017, pp. 221–231.
LibreCat
 
[41]
2017 | Journal Article | LibreCat-ID: 10155
G. Mazzuoccolo and E. Steffen, “Nowhere-zero 5-flows on cubic graphs with oddness 4,” J. Graph Theory, vol. 85, pp. 363 – 371, 2017.
LibreCat
 
[40]
2017 | Journal Article | LibreCat-ID: 10156
S. Bej and E. Steffen, “Factors of edge-chromatic critical graphs: a brief survey and some equivalences,” Lecture Notes of Seminario Interdisciplinare di Matematica, vol. 14, pp. 37–48, 2017.
LibreCat
 
[39]
2017 | Journal Article | LibreCat-ID: 10157
L. Jin and E. Steffen, “Petersen cores and the oddness of cubic graphs,” J. Graph Theory, vol. 84, pp. 109–120, 2017.
LibreCat
 
[38]
2016 | Journal Article | LibreCat-ID: 10158
L. Jin, Y. Kang, and E. Steffen, “Face-degree bounds for planar critical graphs,” Electronic Journal of Combinatorics, vol. 23, no. 3, 2016.
LibreCat
 
[37]
2016 | Journal Article | LibreCat-ID: 10160
L. Jin, Y. Kang, and E. Steffen, “Remarks on planar critical graphs,” Discrete Applied Mathematics, vol. 200, pp. 200–202, 2016.
LibreCat
 
[36]
2016 | Journal Article | LibreCat-ID: 10161
L. Jin, Y. Kang, and E. Steffen, “Choosability in signed planar graphs,” European J. Combinatorics, vol. 52, pp. 234–243, 2016.
LibreCat
 
[35]
2016 | Journal Article | LibreCat-ID: 10159
Y. Kang and E. Steffen, “The chromatic spectrum of signed graphs,” Discrete Mathematics , vol. 339, pp. 234–243, 2016.
LibreCat
 
[34]
2015 | Journal Article | LibreCat-ID: 10165
E. Steffen, “1-factor-and cycle covers of cubic graphs,” J. Graph Theory, vol. 78, no. 3, pp. 195 – 206, 2015.
LibreCat
 
[33]
2015 | Journal Article | LibreCat-ID: 10166
M. Schubert and E. Steffen, “Nowhere-zero flows on signed regular graphs,” European J. Combinatorics, vol. 48, pp. 34–47, 2015.
LibreCat
 
[32]
2015 | Journal Article | LibreCat-ID: 10162
E. Steffen, “Intersecting 1-factors and nowhere-zero 5-flows,” Combinatorica, vol. 35, pp. 633–640, 2015.
LibreCat
 
[31]
2015 | Journal Article | LibreCat-ID: 10163
E. Steffen, “Edge-colorings and circular flow numbers of regular graphs,” J. Graph Theory, vol. 79, pp. 1–7, 2015.
LibreCat
 
[30]
2015 | Journal Article | LibreCat-ID: 10164
E. Máčajová and E. Steffen, “The difference between the circular and the integer flow number of bidirected graphs,” Discrete Mathematics, vol. 338, pp. 866–867, 2015.
LibreCat
 
[29]
2014 | Journal Article | LibreCat-ID: 10167
M. Schubert and E. Steffen, “The set of circular flow numbers of regular graphs,” J. Graph Theory, vol. 76, pp. 297–308, 2014.
LibreCat
 
[28]
2014 | Journal Article | LibreCat-ID: 10169
J. Hägglund and E. Steffen, “Petersen colorings and some families of snarks,” Ars Mathematica Contemporanea, vol. 312, pp. 476–478, 2014.
LibreCat
 
[27]
2012 | Journal Article | LibreCat-ID: 10172
V. Mkrtchyan and E. Steffen, “Maximum Δ-edge-colorable subgraphs of class II graphs,” J. Graph Theory, vol. 70, pp. 473–482, 2012.
LibreCat
 
[26]
2012 | Journal Article | LibreCat-ID: 10173
V. Mkrtchyan and E. Steffen, “Measures of edge-uncolorability,” Discrete Mathematics, vol. 312, pp. 476–478, 2012.
LibreCat
 
[25]
2012 | Journal Article | LibreCat-ID: 10170
G. Brinkmann, Simon Crevals, H. Melot, Leanne J. Rylands, and E. Steffen, “α-labelings and the structure of trees with nonzero α-deficit ,” Discrete Mathematics. and Theoretical Computer Science, vol. 14.1, pp. 159–174, 2012.
LibreCat
 
[24]
2012 | Journal Article | LibreCat-ID: 10171
E. Steffen, “Nearly nowhere-zero r-flow graphs,” Discrete Mathematics, vol. 312, pp. 2757–2759, 2012.
LibreCat
 
[23]
2010 | Journal Article | LibreCat-ID: 10174
E. Steffen, “Tutte’s 5-flow conjecture for cyclically highly connected cubic graphs,” Discrete Mathematics, vol. 310, pp. 385–389, 2010.
LibreCat
 
[22]
2010 | Preprint | LibreCat-ID: 10202
V. Mkrtchyan and E. Steffen, “Bricks and conjectures of Berge, Fulkerson and Seymour,” arXiv:1003.5782. 2010.
LibreCat
 
[21]
2008 | Journal Article | LibreCat-ID: 10175
B. Mohar and E. Steffen, “Relating embedding and coloring properties of snarks,” Ars Mathematica Contemporanea, vol. 1, pp. 169–184, 2008.
LibreCat
 
[20]
2006 | Journal Article | LibreCat-ID: 10176
M. Boben, T. Pisanski, N. Ravnik, and E. Steffen, “Erratum to „Reductions of Symmetry configurations n3,” Discrete Applied Mathematics, vol. 154, no. 11, pp. 1645–1646, 2006.
LibreCat
 
[19]
2004 | Journal Article | LibreCat-ID: 10177
E. Steffen, “Measurements of edge-uncolorability,” Discrete Mathematics, vol. 280, pp. 191–214, 2004.
LibreCat
 
[18]
2004 | Journal Article | LibreCat-ID: 10178
S. Grünewald and E. Steffen, “Independent Sets and 2-factors in edge-chromatic critical graphs,” J. Graph Theory, vol. 45, pp. 113–118, 2004.
LibreCat
 
[17]
2001 | Journal Article | LibreCat-ID: 10180
E. Steffen, “On bicritical snarks,” Math. Slovaca, vol. 51, pp. 141–150, 2001.
LibreCat
 
[16]
2001 | Journal Article | LibreCat-ID: 10179
E. Steffen, “Circular flow numbers of regular multigraphs,” J. Graph Theory, vol. 36, pp. 24–34, 2001.
LibreCat
 
[15]
2000 | Journal Article | LibreCat-ID: 10186
H. G. Carstens, T. Dinski, and E. Steffen, “Reductions of Symmetry configurations n3,” Discrete Applied Mathematics, vol. 99, pp. 401–411, 2000.
LibreCat
 
[14]
2000 | Journal Article | LibreCat-ID: 10182
G. Brinkmann, S. A. Choudum, S. Grünewald, and E. Steffen, “Bounds for the independence number of critical graphs,” Bull. London Math. Soc., vol. 32, pp. 137–140, 2000.
LibreCat
 
[13]
2000 | Journal Article | LibreCat-ID: 10183
E. Steffen, “A refinement of Vizing’s theorem,” Discrete Mathematics, vol. 218, pp. 289–291, 2000.
LibreCat
 
[12]
1999 | Journal Article | LibreCat-ID: 10191
S. Grünewald and E. Steffen, “Chromatic-index-critical graphs of even order,” J. Graph Theory, vol. 30, pp. 27–36, 1999.
LibreCat
 
[11]
1999 | Journal Article | LibreCat-ID: 10189
E. Steffen, “Non-bicritical critical snarks,” Graphs Comb., vol. 15, pp. 473–480, 1999.
LibreCat
 
[10]
1999 | Journal Article | LibreCat-ID: 10187
E. Steffen, “Counterexamples to a conjecture about Petersen-minors in supersnarks,” Discrete Mathematics, vol. 207, pp. 291–292, 1999.
LibreCat
 
[9]
1999 | Journal Article | LibreCat-ID: 10190
S. Grünewald and E. Steffen, “Cyclically 5-edge connected non-bicritical critical snarks,” Discuss. Math. Graph Theory, vol. 19, pp. 5–11, 1999.
LibreCat
 
[8]
1998 | Journal Article | LibreCat-ID: 10193
G. Brinkmann and E. Steffen, “Snarks and reducibility,” Ars Combinatoria, vol. 50, pp. 292–296, 1998.
LibreCat
 
[7]
1998 | Journal Article | LibreCat-ID: 10194
G. Brinkmann and E. Steffen, “Chromatic-index-critical graphs of Orders 11 and 12,” European J. Combinatorics, vol. 19, pp. 889–900, 1998.
LibreCat
 
[6]
1998 | Journal Article | LibreCat-ID: 10195
E. Steffen, “Classification and characterizations of snarkse,” Discrete Mathematics, vol. 188, pp. 183-203 (, 1998.
LibreCat
 
[5]
1997 | Journal Article | LibreCat-ID: 10196
G. Brinkmann and E. Steffen, “3- and 4-critical graphs of small even order,” Discrete Mathematics, vol. 188, pp. 193–197, 1997.
LibreCat
 
[4]
1996 | Journal Article | LibreCat-ID: 10197
E. Steffen, “Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs,” Discrete Mathematics, vol. 161, p. 315, 1996.
LibreCat
 
[3]
1996 | Journal Article | LibreCat-ID: 10198
E. Steffen and X. Zhu, “Star chromatic numbers of graphs,” Combinatorica, vol. 16, pp. 439–448, 1996.
LibreCat
 
[2]
1996 | Journal Article | LibreCat-ID: 10199
E. Steffen, “Tutte’s 5-flow conjecture for graphs of non-orientable genus 5,” J. Graph Theory, vol. 22, pp. 309–319, 1996.
LibreCat
 
[1]
1992 | Conference Paper | LibreCat-ID: 10201
E. Steffen, “Complexity results for the default- and autoepistemic logic,” in Computer Science Logic , 1992, vol. 626, pp. 339–352.
LibreCat
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed