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.
73 Publications
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
2012 | Journal Article | LibreCat-ID: 10173
Mkrtchyan, Vahan, and Eckhard Steffen. “Measures of Edge-Uncolorability.” Discrete Mathematics 312 (2012): 476–78.
LibreCat
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
2010 | Preprint | LibreCat-ID: 10202
Mkrtchyan, Vahan, and Eckhard Steffen. “Bricks and Conjectures of Berge, Fulkerson and Seymour.” ArXiv:1003.5782, 2010.
LibreCat
2008 | Journal Article | LibreCat-ID: 10175
Mohar, Bojan, Eckhard Steffen, and Andrej Vodopivec. “Relating Embedding and Coloring Properties of Snarks.” Ars Mathematica Contemporanea 1 (2008): 169–84.
LibreCat
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
2004 | Journal Article | LibreCat-ID: 10177
Steffen, Eckhard. “Measurements of Edge-Uncolorability.” Discrete Mathematics 280 (2004): 191–214.
LibreCat
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
2001 | Journal Article | LibreCat-ID: 10179
Steffen, Eckhard. “Circular Flow Numbers of Regular Multigraphs.” J. Graph Theory 36 (2001): 24–34.
LibreCat
2001 | Journal Article | LibreCat-ID: 10180
Steffen, Eckhard. “On Bicritical Snarks.” Math. Slovaca 51 (2001): 141–50.
LibreCat
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
2000 | Journal Article | LibreCat-ID: 10183
Steffen, Eckhard. “A Refinement of Vizing’s Theorem.” Discrete Mathematics 218 (2000): 289–91.
LibreCat