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
2018 | Journal Article | LibreCat-ID: 10142
Steffen, Eckhard. “Approximating Vizing’s Independence Number Conjecture.” Australasian Journal of Combinatorics 71, no. 1 (2018): 153–60.
LibreCat
2017 | Book (Editor) | LibreCat-ID: 10146
Maier, Günter W., Gregor Engels, and Eckhard Steffen, eds. Handbuch Gestaltung digitaler und vernetzter Arbeitswelten. 1st ed. Springer Berlin Heidelberg, 2017.
LibreCat
2017 | Book Chapter | LibreCat-ID: 10147
Simon, Dagmar, and Eckhard Steffen. “Digitale Zukunft: ein inter- und transdisziplinäres Thema.” In Handbuch Gestaltung digitaler und vernetzter Arbeitswelten, edited by Günter W. Maier, Gregor Engels, and Eckhard Steffen, 1st ed., 1–12. Springer Berlin Heidelberg, 2017.
LibreCat
2017 | Journal Article | LibreCat-ID: 10155
Mazzuoccolo, Guiseppe, and Eckhard Steffen. “Nowhere-Zero 5-Flows on Cubic Graphs with Oddness 4.” J. Graph Theory 85 (2017): 363 – 371.
LibreCat
2017 | Journal Article | LibreCat-ID: 10156
Bej, Saptarshi, and Eckhard Steffen. “Factors of Edge-Chromatic Critical Graphs: A Brief Survey and Some Equivalences.” Lecture Notes of Seminario Interdisciplinare Di Matematica 14 (2017): 37–48.
LibreCat
2017 | Journal Article | LibreCat-ID: 10157
Jin, Ligang, and Eckhard Steffen. “Petersen Cores and the Oddness of Cubic Graphs.” J. Graph Theory 84 (2017): 109–20.
LibreCat
2016 | Journal Article | LibreCat-ID: 10158
Jin, Ligang, Yingli Kang, and Eckhard Steffen. “Face-Degree Bounds for Planar Critical Graphs.” Electronic Journal of Combinatorics 23, no. 3 (2016).
LibreCat
2016 | Journal Article | LibreCat-ID: 10159
Kang, Yingli, and Eckhard Steffen. “The Chromatic Spectrum of Signed Graphs.” Discrete Mathematics 339 (2016): 234–43.
LibreCat
2016 | Journal Article | LibreCat-ID: 10160
Jin, Ligang, Yingli Kang, and Eckhard Steffen. “Remarks on Planar Critical Graphs.” Discrete Applied Mathematics 200 (2016): 200–202.
LibreCat
2016 | Journal Article | LibreCat-ID: 10161
Jin, Ligang, Yingli Kang, and Eckhard Steffen. “Choosability in Signed Planar Graphs.” European J. Combinatorics 52 (2016): 234–43.
LibreCat
2015 | Journal Article | LibreCat-ID: 10162
Steffen, Eckhard. “Intersecting 1-Factors and Nowhere-Zero 5-Flows.” Combinatorica 35 (2015): 633–40.
LibreCat
2015 | Journal Article | LibreCat-ID: 10163
Steffen, Eckhard. “Edge-Colorings and Circular Flow Numbers of Regular Graphs.” J. Graph Theory 79 (2015): 1–7.
LibreCat
2015 | Journal Article | LibreCat-ID: 10164
Máčajová, Edita, and Eckhard Steffen. “The Difference between the Circular and the Integer Flow Number of Bidirected Graphs.” Discrete Mathematics 338 (2015): 866–67.
LibreCat
2015 | Journal Article | LibreCat-ID: 10165
Steffen, Eckhard. “1-Factor-and Cycle Covers of Cubic Graphs.” J. Graph Theory 78, no. 3 (2015): 195 – 206.
LibreCat
2015 | Journal Article | LibreCat-ID: 10166
Schubert, Michael, and Eckhard Steffen. “Nowhere-Zero Flows on Signed Regular Graphs.” European J. Combinatorics 48 (2015): 34–47.
LibreCat
2014 | Journal Article | LibreCat-ID: 10167
Schubert, Michael, and Eckhard Steffen. “The Set of Circular Flow Numbers of Regular Graphs.” J. Graph Theory 76 (2014): 297–308.
LibreCat
2014 | Journal Article | LibreCat-ID: 10169
Hägglund, Jonas, and Eckhard Steffen. “Petersen Colorings and Some Families of Snarks.” Ars Mathematica Contemporanea 312 (2014): 476–78.
LibreCat
2012 | Journal Article | LibreCat-ID: 10170
Brinkmann, Gunnar, Simon Crevals, Hadrien Melot, Leanne J. Rylands, and Eckhard Steffen. “α-Labelings and the Structure of Trees with Nonzero α-Deficit .” Discrete Mathematics. and Theoretical Computer Science 14.1 (2012): 159–74.
LibreCat
2012 | Journal Article | LibreCat-ID: 10171
Steffen, Eckhard. “Nearly Nowhere-Zero r-Flow Graphs.” Discrete Mathematics 312 (2012): 2757–59.
LibreCat
2012 | Journal Article | LibreCat-ID: 10172
Mkrtchyan, Vahan, and Eckhard Steffen. “Maximum Δ-Edge-Colorable Subgraphs of Class II Graphs.” J. Graph Theory 70 (2012): 473–82.
LibreCat