Eckhard Steffen

67 papers C 2Journal 64

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Critically 3-frustrated signed graphs. Discret. Math. Chiara Cappello, Reza Naserasr, Eckhard Steffen, Zhouningxin Wang
2025	J	`jnl`	Information dissemination and confusion in signed networks. Discret. Appl. Math. Ligang Jin, Eckhard Steffen
2025	J	`jnl`	Sets of r-Graphs that Color All r-Graphs. Comb. Yulai Ma, Davide Mattiolo, Eckhard Steffen, Isaak H. Wolf
2024	J	`jnl`	Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs. Comb. Yulai Ma, Davide Mattiolo, Eckhard Steffen, Isaak H. Wolf
2024	J	`jnl`	Information dissemination and confusion in signed networks. CoRR Ligang Jin, Eckhard Steffen
2023	J	`jnl`	Algorithms for the genome median under a restricted measure of rearrangement. RAIRO Oper. Res. Helmuth O. M. Silva, Diego P. Rubert, Eloi Araujo, Eckhard Steffen, Daniel Doerr, Fábio Viduani Martinez
2023	J	`jnl`	Bounds for the chromatic index of signed multigraphs. Discret. Appl. Math. Eckhard Steffen, Isaak H. Wolf
2023	J	`jnl`	Pairwise Disjoint Perfect Matchings in SIAM J. Discret. Math. Yulai Ma, Davide Mattiolo, Eckhard Steffen, Isaak H. Wolf
2022	J	`jnl`	Edge colorings and circular flows on regular graphs. J. Graph Theory Davide Mattiolo, Eckhard Steffen
2022	J	`jnl`	Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices. Graphs Comb. Eckhard Steffen, Isaak H. Wolf
2022	J	`jnl`	Frustration-critical signed graphs. Discret. Appl. Math. Chiara Cappello, Eckhard Steffen
2022	J	`jnl`	Highly edge-connected regular graphs without large factorizable subgraphs. J. Graph Theory Davide Mattiolo, Eckhard Steffen
2021	J	`jnl`	Concepts of signed graph coloring. Eur. J. Comb. Eckhard Steffen, Alexander Vogel
2021	J	`jnl`	Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs. Graphs Comb. Antje Klopp, Eckhard Steffen
2020	J	`jnl`	Flows on Signed Graphs without Long Barbells. SIAM J. Discret. Math. You Lu, Rong Luo, Michael Schubert, Eckhard Steffen, Cun-Quan Zhang
2019	J	`jnl`	Fractional matchings and component-factors of (edge-chromatic critical) graphs. CoRR Antje Klopp, Eckhard Steffen
2018	J	`jnl`	Approximating Vizing's independence number conjecture. Australas. J Comb. Eckhard Steffen
2018	J	`jnl`	Circular coloring of signed graphs. J. Graph Theory Ying-li Kang, Eckhard Steffen
2018	J	`jnl`	Cores, joins and the Fano-flow conjectures. Discuss. Math. Graph Theory Ligang Jin, Giuseppe Mazzuoccolo, Eckhard Steffen
2018	J	`jnl`	Flows in Signed Graphs with Two Negative Edges. Electron. J. Comb. Edita Rollová, Michael Schubert, Eckhard Steffen
2018	J	`jnl`	Measures of Edge-Uncolorability of Cubic Graphs. Electron. J. Comb. Miquel A. Fiol, Giuseppe Mazzuoccolo, Eckhard Steffen
2017	J	`jnl`	Nowhere-Zero 5-Flows On Cubic Graphs with Oddness 4. J. Graph Theory Giuseppe Mazzuoccolo, Eckhard Steffen
2017	J	`jnl`	Petersen Cores and the Oddness of Cubic Graphs. J. Graph Theory Ligang Jin, Eckhard Steffen
2016	J	`jnl`	Choosability in signed planar graphs. Eur. J. Comb. Ligang Jin, Ying-li Kang, Eckhard Steffen
2016	J	`jnl`	Face-Degree Bounds for Planar Critical Graphs. Electron. J. Comb. Ligang Jin, Ying-li Kang, Eckhard Steffen
2016	J	`jnl`	Remarks on planar edge-chromatic critical graphs. Discret. Appl. Math. Ligang Jin, Ying-li Kang, Eckhard Steffen
2016	J	`jnl`	The chromatic spectrum of signed graphs. Discret. Math. Ying-li Kang, Eckhard Steffen
2015	J	`jnl`	1-Factor and Cycle Covers of Cubic Graphs. J. Graph Theory Eckhard Steffen
2015	J	`jnl`	Edge Colorings and Circular Flow Numbers of Regular Graphs. J. Graph Theory Eckhard Steffen
2015	J	`jnl`	Intersecting 1-factors and nowhere-zero 5-flows. Comb. Eckhard Steffen
2015	J	`jnl`	Nowhere-zero 5-flows. Electron. Notes Discret. Math. Eckhard Steffen, Giuseppe Mazzuoccolo
2015	J	`jnl`	Nowhere-zero flows on signed regular graphs. Eur. J. Comb. Michael Schubert, Eckhard Steffen
2015	J	`jnl`	The difference between the circular and the integer flow number of bidirected graphs. Discret. Math. Edita Mácajová, Eckhard Steffen
2014	J	`jnl`	Petersen-colorings and some families of snarks. Ars Math. Contemp. Jonas Hägglund, Eckhard Steffen
2014	J	`jnl`	The Set of Circular Flow Numbers of Regular Graphs. J. Graph Theory Michael Schubert, Eckhard Steffen
2013	C	`conf`	1-factors and circuits of cubic graphs. CTW Eckhard Steffen
2013	J	`jnl`	Edge-colorings and circular flow numbers on regular graphs. CoRR Eckhard Steffen
2013	J	`jnl`	Nowhere-zero flows on signed regular graphs. CoRR Michael Schubert, Eckhard Steffen
2012	J	`jnl`	Maximum Δ-edge-colorable subgraphs of class II graphs. J. Graph Theory Vahan V. Mkrtchyan, Eckhard Steffen
2012	J	`jnl`	Measures of edge-uncolorability. Discret. Math. Vahan V. Mkrtchyan, Eckhard Steffen
2012	J	`jnl`	Nearly nowhere-zero r-flow graphs. Discret. Math. Eckhard Steffen
2012	J	`jnl`	α-Labelings and the Structure of Trees with Nonzero α-Deficit. Discret. Math. Theor. Comput. Sci. Gunnar Brinkmann, Simon Crevals, Hadrien Mélot, Leanne Rylands, Eckhard Steffen
2010	J	`jnl`	Bricks and conjectures of Berge, Fulkerson and Seymour CoRR Vahan V. Mkrtchyan, Eckhard Steffen
2010	J	`jnl`	Maximum $\Delta$-edge-colorable subgraphs of class II graphs CoRR Vahan V. Mkrtchyan, Eckhard Steffen
2010	C	`conf`	Maximum Delta-edge-colorable Subgraphs of Class II Graphs. CTW Vahan V. Mkrtchyan, Eckhard Steffen
2010	J	`jnl`	Measures of edge-uncolorability CoRR Vahan V. Mkrtchyan, Eckhard Steffen
2010	J	`jnl`	Tutte's 5-flow conjecture for highly cyclically connected cubic graphs. Discret. Math. Eckhard Steffen
2008	J	`jnl`	Relating embedding and coloring properties of snarks. Ars Math. Contemp. Bojan Mohar, Eckhard Steffen, Andrej Vodopivec
2007	J	`jnl`	Tutte's 5-flow conjecture for highly cyclically connected cubic graphs. Electron. Notes Discret. Math. Eckhard Steffen
2006	J	`jnl`	Erratum to "Reduction of symmetric configurations n Discret. Appl. Math. Eckhard Steffen, Tomaz Pisanski, Marko Boben, Natasa Ravnik
2004	J	`jnl`	Independent sets and 2-factors in edge-chromatic-critical graphs. J. Graph Theory Stefan Grünewald, Eckhard Steffen
2004	J	`jnl`	Measurements of edge-uncolorability. Discret. Math. Eckhard Steffen
2001	J	`jnl`	Circular flow numbers of regular multigraphs. J. Graph Theory Eckhard Steffen
2000	J	`jnl`	A refinement of Vizing's theorem. Discret. Math. Eckhard Steffen
2000	J	`jnl`	Reduction of Symmetric Configurations n Discret. Appl. Math. Hans Georg Carstens, Thomas Dinski, Eckhard Steffen
1999	J	`jnl`	Chromatic-index-critical graphs of even order. J. Graph Theory Stefan Grünewald, Eckhard Steffen
1999	J	`jnl`	Counterexamples to a conjecture about Petersen-minors in supersnarks. Discret. Math. Eckhard Steffen
1999	J	`jnl`	Cyclically 5-edge connected non-bicritical critical snarks. Discuss. Math. Graph Theory Stefan Grünewald, Eckhard Steffen
1999	J	`jnl`	Non-Bicritical Critical Snarks. Graphs Comb. Eckhard Steffen
1998	J	`jnl`	Chromatic-Index-Critical Graphs of Orders 11 and 12. Eur. J. Comb. Gunnar Brinkmann, Eckhard Steffen
1998	J	`jnl`	Classifications and characterizations of snarks. Discret. Math. Eckhard Steffen
1998	J	`jnl`	Snarks and Reducibility. Ars Comb. Gunnar Brinkmann, Eckhard Steffen
1997	J	`jnl`	3- and 4-critical graphs of small even order. Discret. Math. Gunnar Brinkmann, Eckhard Steffen
1996	J	`jnl`	Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs. Discret. Math. Eckhard Steffen
1996	J	`jnl`	Star Chromatic Numbers of Graphs. Comb. Eckhard Steffen, Xuding Zhu
1996	J	`jnl`	Tutte's 5-flow conjecture for graphs of nonorientable genus 5. J. Graph Theory Eckhard Steffen
1991	—	`—`	Die Komplexität von Entscheidungsproblemen in der "Default Logic" und der autoepistemischen Logik. Eckhard Steffen