53 Publications

Mark all

[53]
2019 | Journal Article | LibreCat-ID: 12971
Jin, Ligang, and Eckhard Steffen. “Unions of 1-Factors in r-Graphs and Overfull Graphs.” J. of Combinatorics, to Appear, 2019.
LibreCat
 
[52]
2019 | Preprint | LibreCat-ID: 13114
Lu, You, Rong Luo, Michael Schubert, Eckhard Steffen, and Cun-Quan Zhang. “Flows on Signed Graphs without Long Barbells.” ArXiv:1908.11004, 2019.
LibreCat
 
[51]
2019 | Preprint | LibreCat-ID: 15445
Mattiolo, Davide, and Eckhard Steffen. “Highly Edge-Connected Regular Graphs without Large Factorizable  Subgraphs.” ArXiv:1912.09704, 2019.
LibreCat
 
[50]
2019 | Preprint | LibreCat-ID: 13445
Steffen, Eckhard, and Alexander Vogel. “Concepts of Signed Graph Coloring.” ArXiv:1909.09381, 2019.
LibreCat
 
[49]
2019 | Preprint | LibreCat-ID: 12970
Klopp, Antje, and Eckhard Steffen. “Fractional Matchings and Component-Factors of (Edge-Chromatic Critical)  Graphs.” ArXiv:1903.12385, 2019.
LibreCat
 
[48]
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
 
[47]
2018 | Journal Article | LibreCat-ID: 10130
Rollová, Edita, Michael Schubert, and Eckhard Steffen. “Signed Graphs with Two Negative Edges .” Electronic Journal of Combinatorics 25, no. 2 (2018).
LibreCat
 
[46]
2018 | Journal Article | LibreCat-ID: 10129
Fiol, M. A., Guiseppe Mazzuoccolo, and Eckhard Steffen. “Measures of Edge-Uncolorability of Cubic Graphs.” The Electronic Journal of Combinatorics 25, no. 4 (2018).
LibreCat
 
[45]
2018 | Journal Article | LibreCat-ID: 10132
Jin, Ligang, Giuseppe Mazzuoccolo, and Eckhard Steffen. “Cores, Joins  and the Fano-Flow Conjectures.” Discussiones Mathematicae Graph Theory 38 (2018): 165–75. https://doi.org/10.7151/dmgt.1999.
LibreCat | DOI
 
[44]
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
 
[43]
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
 
[42]
2017 | Book Chapter | LibreCat-ID: 10143
Engels, Gregor, Günter W. Maier, Sonja K. Ötting, Eckhard Steffen, and Alexander Teetz. “Gerechtigkeit in flexiblen Arbeits- und Managementprozessen.” In Zukunft der Arbeit – Eine praxsnahe Betrachtung, edited by S. Wischmann and E.  A Hartmann, 221–31. Springer Vieweg, 2017.
LibreCat
 
[41]
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
 
[40]
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
 
[39]
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
 
[38]
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
 
[37]
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
 
[36]
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
 
[35]
2016 | Journal Article | LibreCat-ID: 10159
Kang, Yingli, and Eckhard Steffen. “The Chromatic Spectrum of Signed Graphs.” Discrete Mathematics 339 (2016): 234–43.
LibreCat
 
[34]
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
 
[33]
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
 
[32]
2015 | Journal Article | LibreCat-ID: 10162
Steffen, Eckhard. “Intersecting 1-Factors and Nowhere-Zero 5-Flows.” Combinatorica 35 (2015): 633–40.
LibreCat
 
[31]
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
 
[30]
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
 
[29]
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
 
[28]
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
 
[27]
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
 
[26]
2012 | Journal Article | LibreCat-ID: 10173
Mkrtchyan, Vahan, and Eckhard Steffen. “Measures of Edge-Uncolorability.” Discrete Mathematics 312 (2012): 476–78.
LibreCat
 
[25]
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
 
[24]
2012 | Journal Article | LibreCat-ID: 10171
Steffen, Eckhard. “Nearly Nowhere-Zero r-Flow Graphs.” Discrete Mathematics 312 (2012): 2757–59.
LibreCat
 
[23]
2010 | Journal Article | LibreCat-ID: 10174
Steffen, Eckhard. “Tutte’s 5-Flow Conjecture for Cyclically Highly Connected Cubic Graphs.” Discrete Mathematics 310 (2010): 385–89.
LibreCat
 
[22]
2010 | Preprint | LibreCat-ID: 10202
Mkrtchyan, Vahan, and Eckhard Steffen. “Bricks and Conjectures of Berge, Fulkerson and Seymour.” ArXiv:1003.5782, 2010.
LibreCat
 
[21]
2008 | Journal Article | LibreCat-ID: 10175
Mohar, Bojan, and Eckhard Steffen. “Relating Embedding and Coloring Properties of Snarks.” Ars Mathematica Contemporanea 1 (2008): 169–84.
LibreCat
 
[20]
2006 | Journal Article | LibreCat-ID: 10176
Boben, Marco, Tomaž Pisanski, Natasa Ravnik, and Eckhard Steffen. “Erratum to „Reductions of Symmetry Configurations N3.” Discrete Applied Mathematics 154, no. 11 (2006): 1645–46.
LibreCat
 
[19]
2004 | Journal Article | LibreCat-ID: 10177
Steffen, Eckhard. “Measurements of Edge-Uncolorability.” Discrete Mathematics 280 (2004): 191–214.
LibreCat
 
[18]
2004 | Journal Article | LibreCat-ID: 10178
Grünewald, Stefan, and Eckhard Steffen. “Independent Sets and 2-Factors in Edge-Chromatic Critical Graphs.” J. Graph Theory 45 (2004): 113–18.
LibreCat
 
[17]
2001 | Journal Article | LibreCat-ID: 10180
Steffen, Eckhard. “On Bicritical Snarks.” Math. Slovaca 51 (2001): 141–50.
LibreCat
 
[16]
2001 | Journal Article | LibreCat-ID: 10179
Steffen, Eckhard. “Circular Flow Numbers of Regular Multigraphs.” J. Graph Theory 36 (2001): 24–34.
LibreCat
 
[15]
2000 | Journal Article | LibreCat-ID: 10186
Carstens, Hans Georg, Thomas Dinski, and Eckhard Steffen. “Reductions of Symmetry Configurations N3.” Discrete Applied Mathematics 99 (2000): 401–11.
LibreCat
 
[14]
2000 | Journal Article | LibreCat-ID: 10182
Brinkmann, Gunnar, Sheshayya A Choudum, Stefan Grünewald, and Eckhard Steffen. “Bounds for the Independence Number of Critical Graphs.” Bull. London Math. Soc. 32 (2000): 137–40.
LibreCat
 
[13]
2000 | Journal Article | LibreCat-ID: 10183
Steffen, Eckhard. “A Refinement of Vizing’s Theorem.” Discrete Mathematics 218 (2000): 289–91.
LibreCat
 
[12]
1999 | Journal Article | LibreCat-ID: 10191
Grünewald, Stefan, and Eckhard Steffen. “Chromatic-Index-Critical Graphs of Even Order.” J. Graph Theory 30 (1999): 27–36.
LibreCat
 
[11]
1999 | Journal Article | LibreCat-ID: 10189
Steffen, Eckhard. “Non-Bicritical Critical Snarks.” Graphs Comb. 15 (1999): 473–80.
LibreCat
 
[10]
1999 | Journal Article | LibreCat-ID: 10187
Steffen, Eckhard. “Counterexamples to a Conjecture about Petersen-Minors in Supersnarks.” Discrete Mathematics 207 (1999): 291–92.
LibreCat
 
[9]
1999 | Journal Article | LibreCat-ID: 10190
Grünewald, Stefan, and Eckhard Steffen. “Cyclically 5-Edge Connected Non-Bicritical Critical Snarks.” Discuss. Math. Graph Theory 19 (1999): 5–11.
LibreCat
 
[8]
1998 | Journal Article | LibreCat-ID: 10193
Brinkmann, Gunnar, and Eckhard Steffen. “Snarks and Reducibility.” Ars Combinatoria 50 (1998): 292–96.
LibreCat
 
[7]
1998 | Journal Article | LibreCat-ID: 10194
Brinkmann, Gunnar, and Eckhard Steffen. “Chromatic-Index-Critical Graphs of Orders 11 and 12.” European J. Combinatorics 19 (1998): 889–900.
LibreCat
 
[6]
1998 | Journal Article | LibreCat-ID: 10195
Steffen, Eckhard. “Classification and Characterizations of Snarkse.” Discrete Mathematics 188 (1998): 183-203 (.
LibreCat
 
[5]
1997 | Journal Article | LibreCat-ID: 10196
Brinkmann, Gunnar, and Eckhard Steffen. “3- and 4-Critical Graphs of Small Even Order.” Discrete Mathematics 188 (1997): 193–97.
LibreCat
 
[4]
1996 | Journal Article | LibreCat-ID: 10197
Steffen, Eckhard. “Counterexamples to a Conjecture about Bottlenecks in Non-Tait-Colourable Cubic Graphs.” Discrete Mathematics 161 (1996): 315.
LibreCat
 
[3]
1996 | Journal Article | LibreCat-ID: 10198
Steffen, Eckhard, and Xuding Zhu. “Star Chromatic Numbers of Graphs.” Combinatorica 16 (1996): 439–48.
LibreCat
 
[2]
1996 | Journal Article | LibreCat-ID: 10199
Steffen, Eckhard. “Tutte’s 5-Flow Conjecture for Graphs of Non-Orientable Genus 5.” J. Graph Theory 22 (1996): 309–19.
LibreCat
 
[1]
1992 | Conference Paper | LibreCat-ID: 10201
Steffen, Eckhard. “Complexity Results for the Default- and Autoepistemic Logic.” In Computer Science Logic , edited by E. Börger, 626:339–52. Springer Berlin Heidelberg, 1992.
LibreCat
 

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed

53 Publications

Mark all

[53]
2019 | Journal Article | LibreCat-ID: 12971
Jin, Ligang, and Eckhard Steffen. “Unions of 1-Factors in r-Graphs and Overfull Graphs.” J. of Combinatorics, to Appear, 2019.
LibreCat
 
[52]
2019 | Preprint | LibreCat-ID: 13114
Lu, You, Rong Luo, Michael Schubert, Eckhard Steffen, and Cun-Quan Zhang. “Flows on Signed Graphs without Long Barbells.” ArXiv:1908.11004, 2019.
LibreCat
 
[51]
2019 | Preprint | LibreCat-ID: 15445
Mattiolo, Davide, and Eckhard Steffen. “Highly Edge-Connected Regular Graphs without Large Factorizable  Subgraphs.” ArXiv:1912.09704, 2019.
LibreCat
 
[50]
2019 | Preprint | LibreCat-ID: 13445
Steffen, Eckhard, and Alexander Vogel. “Concepts of Signed Graph Coloring.” ArXiv:1909.09381, 2019.
LibreCat
 
[49]
2019 | Preprint | LibreCat-ID: 12970
Klopp, Antje, and Eckhard Steffen. “Fractional Matchings and Component-Factors of (Edge-Chromatic Critical)  Graphs.” ArXiv:1903.12385, 2019.
LibreCat
 
[48]
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
 
[47]
2018 | Journal Article | LibreCat-ID: 10130
Rollová, Edita, Michael Schubert, and Eckhard Steffen. “Signed Graphs with Two Negative Edges .” Electronic Journal of Combinatorics 25, no. 2 (2018).
LibreCat
 
[46]
2018 | Journal Article | LibreCat-ID: 10129
Fiol, M. A., Guiseppe Mazzuoccolo, and Eckhard Steffen. “Measures of Edge-Uncolorability of Cubic Graphs.” The Electronic Journal of Combinatorics 25, no. 4 (2018).
LibreCat
 
[45]
2018 | Journal Article | LibreCat-ID: 10132
Jin, Ligang, Giuseppe Mazzuoccolo, and Eckhard Steffen. “Cores, Joins  and the Fano-Flow Conjectures.” Discussiones Mathematicae Graph Theory 38 (2018): 165–75. https://doi.org/10.7151/dmgt.1999.
LibreCat | DOI
 
[44]
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
 
[43]
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
 
[42]
2017 | Book Chapter | LibreCat-ID: 10143
Engels, Gregor, Günter W. Maier, Sonja K. Ötting, Eckhard Steffen, and Alexander Teetz. “Gerechtigkeit in flexiblen Arbeits- und Managementprozessen.” In Zukunft der Arbeit – Eine praxsnahe Betrachtung, edited by S. Wischmann and E.  A Hartmann, 221–31. Springer Vieweg, 2017.
LibreCat
 
[41]
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
 
[40]
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
 
[39]
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
 
[38]
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
 
[37]
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
 
[36]
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
 
[35]
2016 | Journal Article | LibreCat-ID: 10159
Kang, Yingli, and Eckhard Steffen. “The Chromatic Spectrum of Signed Graphs.” Discrete Mathematics 339 (2016): 234–43.
LibreCat
 
[34]
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
 
[33]
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
 
[32]
2015 | Journal Article | LibreCat-ID: 10162
Steffen, Eckhard. “Intersecting 1-Factors and Nowhere-Zero 5-Flows.” Combinatorica 35 (2015): 633–40.
LibreCat
 
[31]
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
 
[30]
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
 
[29]
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
 
[28]
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
 
[27]
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
 
[26]
2012 | Journal Article | LibreCat-ID: 10173
Mkrtchyan, Vahan, and Eckhard Steffen. “Measures of Edge-Uncolorability.” Discrete Mathematics 312 (2012): 476–78.
LibreCat
 
[25]
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
 
[24]
2012 | Journal Article | LibreCat-ID: 10171
Steffen, Eckhard. “Nearly Nowhere-Zero r-Flow Graphs.” Discrete Mathematics 312 (2012): 2757–59.
LibreCat
 
[23]
2010 | Journal Article | LibreCat-ID: 10174
Steffen, Eckhard. “Tutte’s 5-Flow Conjecture for Cyclically Highly Connected Cubic Graphs.” Discrete Mathematics 310 (2010): 385–89.
LibreCat
 
[22]
2010 | Preprint | LibreCat-ID: 10202
Mkrtchyan, Vahan, and Eckhard Steffen. “Bricks and Conjectures of Berge, Fulkerson and Seymour.” ArXiv:1003.5782, 2010.
LibreCat
 
[21]
2008 | Journal Article | LibreCat-ID: 10175
Mohar, Bojan, and Eckhard Steffen. “Relating Embedding and Coloring Properties of Snarks.” Ars Mathematica Contemporanea 1 (2008): 169–84.
LibreCat
 
[20]
2006 | Journal Article | LibreCat-ID: 10176
Boben, Marco, Tomaž Pisanski, Natasa Ravnik, and Eckhard Steffen. “Erratum to „Reductions of Symmetry Configurations N3.” Discrete Applied Mathematics 154, no. 11 (2006): 1645–46.
LibreCat
 
[19]
2004 | Journal Article | LibreCat-ID: 10177
Steffen, Eckhard. “Measurements of Edge-Uncolorability.” Discrete Mathematics 280 (2004): 191–214.
LibreCat
 
[18]
2004 | Journal Article | LibreCat-ID: 10178
Grünewald, Stefan, and Eckhard Steffen. “Independent Sets and 2-Factors in Edge-Chromatic Critical Graphs.” J. Graph Theory 45 (2004): 113–18.
LibreCat
 
[17]
2001 | Journal Article | LibreCat-ID: 10180
Steffen, Eckhard. “On Bicritical Snarks.” Math. Slovaca 51 (2001): 141–50.
LibreCat
 
[16]
2001 | Journal Article | LibreCat-ID: 10179
Steffen, Eckhard. “Circular Flow Numbers of Regular Multigraphs.” J. Graph Theory 36 (2001): 24–34.
LibreCat
 
[15]
2000 | Journal Article | LibreCat-ID: 10186
Carstens, Hans Georg, Thomas Dinski, and Eckhard Steffen. “Reductions of Symmetry Configurations N3.” Discrete Applied Mathematics 99 (2000): 401–11.
LibreCat
 
[14]
2000 | Journal Article | LibreCat-ID: 10182
Brinkmann, Gunnar, Sheshayya A Choudum, Stefan Grünewald, and Eckhard Steffen. “Bounds for the Independence Number of Critical Graphs.” Bull. London Math. Soc. 32 (2000): 137–40.
LibreCat
 
[13]
2000 | Journal Article | LibreCat-ID: 10183
Steffen, Eckhard. “A Refinement of Vizing’s Theorem.” Discrete Mathematics 218 (2000): 289–91.
LibreCat
 
[12]
1999 | Journal Article | LibreCat-ID: 10191
Grünewald, Stefan, and Eckhard Steffen. “Chromatic-Index-Critical Graphs of Even Order.” J. Graph Theory 30 (1999): 27–36.
LibreCat
 
[11]
1999 | Journal Article | LibreCat-ID: 10189
Steffen, Eckhard. “Non-Bicritical Critical Snarks.” Graphs Comb. 15 (1999): 473–80.
LibreCat
 
[10]
1999 | Journal Article | LibreCat-ID: 10187
Steffen, Eckhard. “Counterexamples to a Conjecture about Petersen-Minors in Supersnarks.” Discrete Mathematics 207 (1999): 291–92.
LibreCat
 
[9]
1999 | Journal Article | LibreCat-ID: 10190
Grünewald, Stefan, and Eckhard Steffen. “Cyclically 5-Edge Connected Non-Bicritical Critical Snarks.” Discuss. Math. Graph Theory 19 (1999): 5–11.
LibreCat
 
[8]
1998 | Journal Article | LibreCat-ID: 10193
Brinkmann, Gunnar, and Eckhard Steffen. “Snarks and Reducibility.” Ars Combinatoria 50 (1998): 292–96.
LibreCat
 
[7]
1998 | Journal Article | LibreCat-ID: 10194
Brinkmann, Gunnar, and Eckhard Steffen. “Chromatic-Index-Critical Graphs of Orders 11 and 12.” European J. Combinatorics 19 (1998): 889–900.
LibreCat
 
[6]
1998 | Journal Article | LibreCat-ID: 10195
Steffen, Eckhard. “Classification and Characterizations of Snarkse.” Discrete Mathematics 188 (1998): 183-203 (.
LibreCat
 
[5]
1997 | Journal Article | LibreCat-ID: 10196
Brinkmann, Gunnar, and Eckhard Steffen. “3- and 4-Critical Graphs of Small Even Order.” Discrete Mathematics 188 (1997): 193–97.
LibreCat
 
[4]
1996 | Journal Article | LibreCat-ID: 10197
Steffen, Eckhard. “Counterexamples to a Conjecture about Bottlenecks in Non-Tait-Colourable Cubic Graphs.” Discrete Mathematics 161 (1996): 315.
LibreCat
 
[3]
1996 | Journal Article | LibreCat-ID: 10198
Steffen, Eckhard, and Xuding Zhu. “Star Chromatic Numbers of Graphs.” Combinatorica 16 (1996): 439–48.
LibreCat
 
[2]
1996 | Journal Article | LibreCat-ID: 10199
Steffen, Eckhard. “Tutte’s 5-Flow Conjecture for Graphs of Non-Orientable Genus 5.” J. Graph Theory 22 (1996): 309–19.
LibreCat
 
[1]
1992 | Conference Paper | LibreCat-ID: 10201
Steffen, Eckhard. “Complexity Results for the Default- and Autoepistemic Logic.” In Computer Science Logic , edited by E. Börger, 626:339–52. Springer Berlin Heidelberg, 1992.
LibreCat
 

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed