Eckhard Steffen

ORCID

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 24

Top Venues

Bielefeld University, Germany (PHD)

Education History

Bielefeld University, Germany

PHD

Publications

Yulai Ma, Davide Mattiolo, Eckhard Steffen, Isaak H. Wolf
Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs. Comb. 44 (2) (2024)
Ligang Jin, Eckhard Steffen
Information dissemination and confusion in signed networks. CoRR (2024)
Yulai Ma, Davide Mattiolo, Eckhard Steffen, Isaak H. Wolf
-Regular Graphs. SIAM J. Discret. Math. 37 (3) (2023)
Helmuth O. M. Silva, Diego P. Rubert, Eloi Araujo, Eckhard Steffen, Daniel Doerr, Fábio Viduani Martinez
Algorithms for the genome median under a restricted measure of rearrangement. RAIRO Oper. Res. 57 (3) (2023)
Eckhard Steffen, Isaak H. Wolf
Bounds for the chromatic index of signed multigraphs. Discret. Appl. Math. 337 (2023)
Davide Mattiolo, Eckhard Steffen
Edge colorings and circular flows on regular graphs. J. Graph Theory 99 (3) (2022)
Eckhard Steffen, Isaak H. Wolf
Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices. Graphs Comb. 38 (3) (2022)
Chiara Cappello, Eckhard Steffen
Frustration-critical signed graphs. Discret. Appl. Math. 322 (2022)
Davide Mattiolo, Eckhard Steffen
Highly edge-connected regular graphs without large factorizable subgraphs. J. Graph Theory 99 (1) (2022)
Eckhard Steffen, Alexander Vogel
Concepts of signed graph coloring. Eur. J. Comb. 91 (2021)
Antje Klopp, Eckhard Steffen
Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs. Graphs Comb. 37 (2) (2021)
You Lu, Rong Luo, Michael Schubert, Eckhard Steffen, Cun-Quan Zhang
Flows on Signed Graphs without Long Barbells. SIAM J. Discret. Math. 34 (4) (2020)
Antje Klopp, Eckhard Steffen
Fractional matchings and component-factors of (edge-chromatic critical) graphs. CoRR (2019)
Edita Rollová, Michael Schubert, Eckhard Steffen
Flows in Signed Graphs with Two Negative Edges. Electron. J. Comb. 25 (2) (2018)
Ligang Jin, Giuseppe Mazzuoccolo, Eckhard Steffen
Cores, joins and the Fano-flow conjectures. Discuss. Math. Graph Theory 38 (1) (2018)
Miquel A. Fiol, Giuseppe Mazzuoccolo, Eckhard Steffen
Measures of Edge-Uncolorability of Cubic Graphs. Electron. J. Comb. 25 (4) (2018)
Ying-li Kang, Eckhard Steffen
Circular coloring of signed graphs. J. Graph Theory 87 (2) (2018)
Eckhard Steffen
Approximating Vizing's independence number conjecture. Australas. J Comb. 71 (2018)
Ligang Jin, Eckhard Steffen
Petersen Cores and the Oddness of Cubic Graphs. J. Graph Theory 84 (2) (2017)
Giuseppe Mazzuoccolo, Eckhard Steffen
Nowhere-Zero 5-Flows On Cubic Graphs with Oddness 4. J. Graph Theory 85 (2) (2017)
Ligang Jin, Ying-li Kang, Eckhard Steffen
Remarks on planar edge-chromatic critical graphs. Discret. Appl. Math. 200 (2016)
Ying-li Kang, Eckhard Steffen
The chromatic spectrum of signed graphs. Discret. Math. 339 (11) (2016)
Ligang Jin, Ying-li Kang, Eckhard Steffen
Face-Degree Bounds for Planar Critical Graphs. Electron. J. Comb. 23 (3) (2016)
Ligang Jin, Ying-li Kang, Eckhard Steffen
Choosability in signed planar graphs. Eur. J. Comb. 52 (2016)
Eckhard Steffen
Intersecting 1-factors and nowhere-zero 5-flows. Comb. 35 (5) (2015)
Eckhard Steffen, Giuseppe Mazzuoccolo
Nowhere-zero 5-flows. Electron. Notes Discret. Math. 49 (2015)
Eckhard Steffen
1-Factor and Cycle Covers of Cubic Graphs. J. Graph Theory 78 (3) (2015)
Edita Mácajová, Eckhard Steffen
The difference between the circular and the integer flow number of bidirected graphs. Discret. Math. 338 (6) (2015)
Michael Schubert, Eckhard Steffen
Nowhere-zero flows on signed regular graphs. Eur. J. Comb. 48 (2015)
Eckhard Steffen
Edge Colorings and Circular Flow Numbers of Regular Graphs. J. Graph Theory 79 (1) (2015)
Michael Schubert, Eckhard Steffen
The Set of Circular Flow Numbers of Regular Graphs. J. Graph Theory 76 (4) (2014)
Jonas Hägglund, Eckhard Steffen
Petersen-colorings and some families of snarks. Ars Math. Contemp. 7 (1) (2014)
Michael Schubert, Eckhard Steffen
Nowhere-zero flows on signed regular graphs. CoRR (2013)
Eckhard Steffen
1-factors and circuits of cubic graphs. CTW (2013)
Eckhard Steffen
Edge-colorings and circular flow numbers on regular graphs. CoRR (2013)
Gunnar Brinkmann, Simon Crevals, Hadrien Mélot, Leanne Rylands, Eckhard Steffen
α-Labelings and the Structure of Trees with Nonzero α-Deficit. Discret. Math. Theor. Comput. Sci. 14 (1) (2012)
Vahan V. Mkrtchyan, Eckhard Steffen
Measures of edge-uncolorability. Discret. Math. 312 (2) (2012)
Eckhard Steffen
Nearly nowhere-zero r-flow graphs. Discret. Math. 312 (18) (2012)
Vahan V. Mkrtchyan, Eckhard Steffen
Maximum Δ-edge-colorable subgraphs of class II graphs. J. Graph Theory 70 (4) (2012)
Vahan V. Mkrtchyan, Eckhard Steffen
Maximum $\Delta$-edge-colorable subgraphs of class II graphs CoRR (2010)
Vahan V. Mkrtchyan, Eckhard Steffen
Measures of edge-uncolorability CoRR (2010)
Vahan V. Mkrtchyan, Eckhard Steffen
Maximum Delta-edge-colorable Subgraphs of Class II Graphs. CTW (2010)
Eckhard Steffen
Tutte's 5-flow conjecture for highly cyclically connected cubic graphs. Discret. Math. 310 (3) (2010)
Vahan V. Mkrtchyan, Eckhard Steffen
Bricks and conjectures of Berge, Fulkerson and Seymour CoRR (2010)
Bojan Mohar, Eckhard Steffen, Andrej Vodopivec
Relating embedding and coloring properties of snarks. Ars Math. Contemp. 1 (2) (2008)
Eckhard Steffen
Tutte's 5-flow conjecture for highly cyclically connected cubic graphs. Electron. Notes Discret. Math. 28 (2007)
Eckhard Steffen, Tomaz Pisanski, Marko Boben, Natasa Ravnik
" [Discrete Appl. Math. 99 (1-3) (2000) 401 -411] Discret. Appl. Math. 154 (11) (2006)
Stefan Grünewald, Eckhard Steffen
Independent sets and 2-factors in edge-chromatic-critical graphs. J. Graph Theory 45 (2) (2004)
Eckhard Steffen
Measurements of edge-uncolorability. Discret. Math. 280 (1-3) (2004)
Eckhard Steffen
Circular flow numbers of regular multigraphs. J. Graph Theory 36 (1) (2001)
Hans Georg Carstens, Thomas Dinski, Eckhard Steffen
. Discret. Appl. Math. 99 (1-3) (2000)
Eckhard Steffen
A refinement of Vizing's theorem. Discret. Math. 218 (1-3) (2000)
Eckhard Steffen
Non-Bicritical Critical Snarks. Graphs Comb. 15 (4) (1999)
Eckhard Steffen
Counterexamples to a conjecture about Petersen-minors in supersnarks. Discret. Math. 207 (1-3) (1999)
Stefan Grünewald, Eckhard Steffen
Cyclically 5-edge connected non-bicritical critical snarks. Discuss. Math. Graph Theory 19 (1) (1999)
Stefan Grünewald, Eckhard Steffen
Chromatic-index-critical graphs of even order. J. Graph Theory 30 (1) (1999)
Gunnar Brinkmann, Eckhard Steffen
Snarks and Reducibility. Ars Comb. 50 (1998)
Eckhard Steffen
Classifications and characterizations of snarks. Discret. Math. 188 (1-3) (1998)
Gunnar Brinkmann, Eckhard Steffen
Chromatic-Index-Critical Graphs of Orders 11 and 12. Eur. J. Comb. 19 (8) (1998)
Gunnar Brinkmann, Eckhard Steffen
3- and 4-critical graphs of small even order. Discret. Math. 169 (1-3) (1997)
Eckhard Steffen, Xuding Zhu
Star Chromatic Numbers of Graphs. Comb. 16 (3) (1996)
Eckhard Steffen
Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs. Discret. Math. 161 (1-3) (1996)
Eckhard Steffen
Tutte's 5-flow conjecture for graphs of nonorientable genus 5. J. Graph Theory 22 (4) (1996)

Eckhard Steffen.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Eckhard Steffen