Die Komplexität von Entscheidungsproblemen in der "Default Logic" und der autoepistemischen Logik. - Eckhard Steffen (1991)

Star Chromatic Numbers of Graphs. - Eckhard Steffen; Xuding Zhu (Comb., 1996)

Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs. - Eckhard Steffen (Discret. Math., 1996)

Tutte's 5-flow conjecture for graphs of nonorientable genus 5. - Eckhard Steffen (J. Graph Theory, 1996)

3- and 4-critical graphs of small even order. - Gunnar Brinkmann; Eckhard Steffen (Discret. Math., 1997)

Snarks and Reducibility. - Gunnar Brinkmann; Eckhard Steffen (Ars Comb., 1998)

Classifications and characterizations of snarks. - Eckhard Steffen (Discret. Math., 1998)

Chromatic-Index-Critical Graphs of Orders 11 and 12. - Gunnar Brinkmann; Eckhard Steffen (Eur. J. Comb., 1998)

Counterexamples to a conjecture about Petersen-minors in supersnarks. - Eckhard Steffen (Discret. Math., 1999)

Cyclically 5-edge connected non-bicritical critical snarks. - Stefan Grünewald; Eckhard Steffen (Discuss. Math. Graph Theory, 1999)

Non-Bicritical Critical Snarks. - Eckhard Steffen (Graphs Comb., 1999)

Chromatic-index-critical graphs of even order. - Stefan Grünewald; Eckhard Steffen (J. Graph Theory, 1999)

Reduction of Symmetric Configurations n3. - Hans Georg Carstens; Thomas Dinski; Eckhard Steffen (Discret. Appl. Math., 2000)

A refinement of Vizing's theorem. - Eckhard Steffen (Discret. Math., 2000)

Circular flow numbers of regular multigraphs. - Eckhard Steffen (J. Graph Theory, 2001)

Measurements of edge-uncolorability. - Eckhard Steffen (Discret. Math., 2004)

Independent sets and 2-factors in edge-chromatic-critical graphs. - Stefan Grünewald; Eckhard Steffen (J. Graph Theory, 2004)

Erratum to "Reduction of symmetric configurations n3" [Discrete Appl. Math. 99 (1-3) (2000) 401 -411] - Eckhard Steffen; Tomaz Pisanski; Marko Boben; Natasa Ravnik (Discret. Appl. Math., 2006)

Tutte's 5-flow conjecture for highly cyclically connected cubic graphs. - Eckhard Steffen (Electron. Notes Discret. Math., 2007)

Relating embedding and coloring properties of snarks. - Bojan Mohar; Eckhard Steffen; Andrej Vodopivec (Ars Math. Contemp., 2008)

Maximum Delta-edge-colorable Subgraphs of Class II Graphs. - Vahan V. Mkrtchyan; Eckhard Steffen (CTW, 2010)

Bricks and conjectures of Berge, Fulkerson and Seymour - Vahan V. Mkrtchyan; Eckhard Steffen (CoRR, 2010)

Measures of edge-uncolorability. - Vahan V. Mkrtchyan; Eckhard Steffen (Discret. Math., 2012)

Nearly nowhere-zero r-flow graphs. - Eckhard Steffen (Discret. Math., 2012)

α-Labelings and the Structure of Trees with Nonzero α-Deficit. - Gunnar Brinkmann; Simon Crevals; Hadrien Mélot; Leanne Rylands; Eckhard Steffen (Discret. Math. Theor. Comput. Sci., 2012)

Maximum Δ-edge-colorable subgraphs of class II graphs. - Vahan V. Mkrtchyan; Eckhard Steffen (J. Graph Theory, 2012)

1-factors and circuits of cubic graphs. - Eckhard Steffen (CTW, 2013)

Petersen-colorings and some families of snarks. - Jonas Hägglund; Eckhard Steffen (Ars Math. Contemp., 2014)

The Set of Circular Flow Numbers of Regular Graphs. - Michael Schubert; Eckhard Steffen (J. Graph Theory, 2014)

Intersecting 1-factors and nowhere-zero 5-flows. - Eckhard Steffen (Comb., 2015)

The difference between the circular and the integer flow number of bidirected graphs. - Edita Mácajová; Eckhard Steffen (Discret. Math., 2015)

Nowhere-zero flows on signed regular graphs. - Michael Schubert; Eckhard Steffen (Eur. J. Comb., 2015)

Nowhere-zero 5-flows. - Eckhard Steffen; Giuseppe Mazzuoccolo (Electron. Notes Discret. Math., 2015)

1-Factor and Cycle Covers of Cubic Graphs. - Eckhard Steffen (J. Graph Theory, 2015)

Edge Colorings and Circular Flow Numbers of Regular Graphs. - Eckhard Steffen (J. Graph Theory, 2015)

Face-Degree Bounds for Planar Critical Graphs. - Ligang Jin; Ying-li Kang; Eckhard Steffen (Electron. J. Comb., 2016)

Remarks on planar edge-chromatic critical graphs. - Ligang Jin; Ying-li Kang; Eckhard Steffen (Discret. Appl. Math., 2016)

The chromatic spectrum of signed graphs. - Ying-li Kang; Eckhard Steffen (Discret. Math., 2016)

Choosability in signed planar graphs. - Ligang Jin; Ying-li Kang; Eckhard Steffen (Eur. J. Comb., 2016)

Petersen Cores and the Oddness of Cubic Graphs. - Ligang Jin; Eckhard Steffen (J. Graph Theory, 2017)

Nowhere-Zero 5-Flows On Cubic Graphs with Oddness 4. - Giuseppe Mazzuoccolo; Eckhard Steffen (J. Graph Theory, 2017)

Approximating Vizing's independence number conjecture. - Eckhard Steffen (Australas. J Comb., 2018)

Measures of Edge-Uncolorability of Cubic Graphs. - Miquel A. Fiol; Giuseppe Mazzuoccolo; Eckhard Steffen (Electron. J. Comb., 2018)

Flows in Signed Graphs with Two Negative Edges. - Edita Rollová; Michael Schubert; Eckhard Steffen (Electron. J. Comb., 2018)

Cores, joins and the Fano-flow conjectures. - Ligang Jin; Giuseppe Mazzuoccolo; Eckhard Steffen (Discuss. Math. Graph Theory, 2018)

Circular coloring of signed graphs. - Ying-li Kang; Eckhard Steffen (J. Graph Theory, 2018)

Fractional matchings and component-factors of (edge-chromatic critical) graphs. - Antje Klopp; Eckhard Steffen (CoRR, 2019)

Flows on Signed Graphs without Long Barbells. - You Lu 002; Rong Luo; Michael Schubert; Eckhard Steffen; Cun-Quan Zhang (SIAM J. Discret. Math., 2020)

Concepts of signed graph coloring. - Eckhard Steffen; Alexander Vogel (Eur. J. Comb., 2021)

Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs. - Antje Klopp; Eckhard Steffen (Graphs Comb., 2021)

Frustration-critical signed graphs. - Chiara Cappello; Eckhard Steffen (Discret. Appl. Math., 2022)

Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices. - Eckhard Steffen; Isaak H. Wolf (Graphs Comb., 2022)

Highly edge-connected regular graphs without large factorizable subgraphs. - Davide Mattiolo; Eckhard Steffen (J. Graph Theory, 2022)

Edge colorings and circular flows on regular graphs. - Davide Mattiolo; Eckhard Steffen (J. Graph Theory, 2022)

Algorithms for the genome median under a restricted measure of rearrangement. - Helmuth O. M. Silva; Diego P. Rubert; Eloi Araujo; Eckhard Steffen; Daniel Doerr; Fábio Viduani Martinez (RAIRO Oper. Res., 2023)

Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs. - Yulai Ma; Davide Mattiolo; Eckhard Steffen; Isaak H. Wolf (SIAM J. Discret. Math., 2023)

Bounds for the chromatic index of signed multigraphs. - Eckhard Steffen; Isaak H. Wolf (Discret. Appl. Math., 2023)

Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs. - Yulai Ma; Davide Mattiolo; Eckhard Steffen; Isaak H. Wolf (Comb., 2024)

Information dissemination and confusion in signed networks. - Ligang Jin; Eckhard Steffen (Discret. Appl. Math., 2025)

Critically 3-frustrated signed graphs. - Chiara Cappello; Reza Naserasr; Eckhard Steffen; Zhouningxin Wang (Discret. Math., 2025)

Sets of r-Graphs that Color All r-Graphs. - Yulai Ma; Davide Mattiolo; Eckhard Steffen; Isaak H. Wolf (Comb., 2025)