default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEckhard Steffen
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j55]Chiara Cappello, Reza Naserasr
, Eckhard Steffen, Zhouningxin Wang:
Critically 3-frustrated signed graphs. Discret. Math. 348(2): 114258 (2025)- 2024
- [j54]Yulai Ma, Davide Mattiolo, Eckhard Steffen, Isaak H. Wolf:
Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs. Comb. 44(2): 429-440 (2024) - [i8]Ligang Jin, Eckhard Steffen:
Information dissemination and confusion in signed networks. CoRR abs/2407.09796 (2024) - 2023
- [j53]Eckhard Steffen, Isaak H. Wolf:
Bounds for the chromatic index of signed multigraphs. Discret. Appl. Math. 337: 185-189 (2023) - [j52]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): 1045-1058 (2023) - [j51]Yulai Ma, Davide Mattiolo, Eckhard Steffen, Isaak H. Wolf:
Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs. SIAM J. Discret. Math. 37(3): 1548-1565 (2023) - 2022
- [j50]Chiara Cappello, Eckhard Steffen:
Frustration-critical signed graphs. Discret. Appl. Math. 322: 183-193 (2022) - [j49]Eckhard Steffen, Isaak H. Wolf:
Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices. Graphs Comb. 38(3): 104 (2022) - [j48]Davide Mattiolo, Eckhard Steffen:
Highly edge-connected regular graphs without large factorizable subgraphs. J. Graph Theory 99(1): 107-116 (2022) - [j47]Davide Mattiolo, Eckhard Steffen:
Edge colorings and circular flows on regular graphs. J. Graph Theory 99(3): 399-413 (2022) - 2021
- [j46]Eckhard Steffen, Alexander Vogel:
Concepts of signed graph coloring. Eur. J. Comb. 91: 103226 (2021) - [j45]Antje Klopp, Eckhard Steffen:
Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs. Graphs Comb. 37(2): 559-580 (2021) - 2020
- [j44]You Lu, Rong Luo, Michael Schubert, Eckhard Steffen, Cun-Quan Zhang:
Flows on Signed Graphs without Long Barbells. SIAM J. Discret. Math. 34(4): 2166-2182 (2020)
2010 – 2019
- 2019
- [i7]Antje Klopp, Eckhard Steffen:
Fractional matchings and component-factors of (edge-chromatic critical) graphs. CoRR abs/1903.12385 (2019) - 2018
- [j43]Eckhard Steffen:
Approximating Vizing's independence number conjecture. Australas. J Comb. 71: 153-160 (2018) - [j42]Edita Rollová, Michael Schubert, Eckhard Steffen:
Flows in Signed Graphs with Two Negative Edges. Electron. J. Comb. 25(2): 2 (2018) - [j41]Miquel A. Fiol, Giuseppe Mazzuoccolo, Eckhard Steffen:
Measures of Edge-Uncolorability of Cubic Graphs. Electron. J. Comb. 25(4): 4 (2018) - [j40]Ligang Jin, Giuseppe Mazzuoccolo, Eckhard Steffen:
Cores, joins and the Fano-flow conjectures. Discuss. Math. Graph Theory 38(1): 165-175 (2018) - [j39]Ying-li Kang, Eckhard Steffen:
Circular coloring of signed graphs. J. Graph Theory 87(2): 135-148 (2018) - 2017
- [j38]Ligang Jin, Eckhard Steffen:
Petersen Cores and the Oddness of Cubic Graphs. J. Graph Theory 84(2): 109-120 (2017) - [j37]Giuseppe Mazzuoccolo, Eckhard Steffen:
Nowhere-Zero 5-Flows On Cubic Graphs with Oddness 4. J. Graph Theory 85(2): 363-371 (2017) - 2016
- [j36]Ligang Jin, Ying-li Kang, Eckhard Steffen:
Face-Degree Bounds for Planar Critical Graphs. Electron. J. Comb. 23(3): 3 (2016) - [j35]Ligang Jin, Ying-li Kang, Eckhard Steffen:
Remarks on planar edge-chromatic critical graphs. Discret. Appl. Math. 200: 200-202 (2016) - [j34]Ying-li Kang, Eckhard Steffen:
The chromatic spectrum of signed graphs. Discret. Math. 339(11): 2660-2663 (2016) - [j33]Ligang Jin, Ying-li Kang, Eckhard Steffen:
Choosability in signed planar graphs. Eur. J. Comb. 52: 234-243 (2016) - 2015
- [j32]Eckhard Steffen:
Intersecting 1-factors and nowhere-zero 5-flows. Comb. 35(5): 633-640 (2015) - [j31]Edita Mácajová, Eckhard Steffen:
The difference between the circular and the integer flow number of bidirected graphs. Discret. Math. 338(6): 866-867 (2015) - [j30]Michael Schubert, Eckhard Steffen:
Nowhere-zero flows on signed regular graphs. Eur. J. Comb. 48: 34-47 (2015) - [j29]Eckhard Steffen, Giuseppe Mazzuoccolo:
Nowhere-zero 5-flows. Electron. Notes Discret. Math. 49: 51-55 (2015) - [j28]Eckhard Steffen:
1-Factor and Cycle Covers of Cubic Graphs. J. Graph Theory 78(3): 195-206 (2015) - [j27]Eckhard Steffen:
Edge Colorings and Circular Flow Numbers of Regular Graphs. J. Graph Theory 79(1): 1-7 (2015) - 2014
- [j26]Jonas Hägglund, Eckhard Steffen:
Petersen-colorings and some families of snarks. Ars Math. Contemp. 7(1): 161-173 (2014) - [j25]Michael Schubert, Eckhard Steffen:
The Set of Circular Flow Numbers of Regular Graphs. J. Graph Theory 76(4): 297-308 (2014) - 2013
- [i6]Eckhard Steffen:
1-factors and circuits of cubic graphs. CTW 2013: 213-216 - [i5]Michael Schubert, Eckhard Steffen:
Nowhere-zero flows on signed regular graphs. CoRR abs/1307.1562 (2013) - [i4]Eckhard Steffen:
Edge-colorings and circular flow numbers on regular graphs. CoRR abs/1310.8441 (2013) - 2012
- [j24]Vahan V. Mkrtchyan, Eckhard Steffen:
Measures of edge-uncolorability. Discret. Math. 312(2): 476-478 (2012) - [j23]Eckhard Steffen:
Nearly nowhere-zero r-flow graphs. Discret. Math. 312(18): 2757-2759 (2012) - [j22]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): 159-174 (2012) - [j21]Vahan V. Mkrtchyan, Eckhard Steffen:
Maximum Δ-edge-colorable subgraphs of class II graphs. J. Graph Theory 70(4): 473-482 (2012) - 2010
- [j20]Eckhard Steffen:
Tutte's 5-flow conjecture for highly cyclically connected cubic graphs. Discret. Math. 310(3): 385-389 (2010) - [c1]Vahan V. Mkrtchyan, Eckhard Steffen:
Maximum Delta-edge-colorable Subgraphs of Class II Graphs. CTW 2010: 129-132 - [i3]Vahan V. Mkrtchyan, Eckhard Steffen:
Maximum $\Delta$-edge-colorable subgraphs of class II graphs. CoRR abs/1002.0783 (2010) - [i2]Vahan V. Mkrtchyan, Eckhard Steffen:
Bricks and conjectures of Berge, Fulkerson and Seymour. CoRR abs/1003.5782 (2010) - [i1]Vahan V. Mkrtchyan, Eckhard Steffen:
Measures of edge-uncolorability. CoRR abs/1003.5783 (2010)
2000 – 2009
- 2008
- [j19]Bojan Mohar, Eckhard Steffen, Andrej Vodopivec:
Relating embedding and coloring properties of snarks. Ars Math. Contemp. 1(2): 169-184 (2008) - 2007
- [j18]Eckhard Steffen:
Tutte's 5-flow conjecture for highly cyclically connected cubic graphs. Electron. Notes Discret. Math. 28: 239-242 (2007) - 2006
- [j17]Eckhard Steffen, Tomaz Pisanski, Marko Boben, Natasa Ravnik:
Erratum to "Reduction of symmetric configurations n3" [Discrete Appl. Math. 99 (1-3) (2000) 401 -411]. Discret. Appl. Math. 154(11): 1645-1646 (2006) - 2004
- [j16]Eckhard Steffen:
Measurements of edge-uncolorability. Discret. Math. 280(1-3): 191-214 (2004) - [j15]Stefan Grünewald, Eckhard Steffen:
Independent sets and 2-factors in edge-chromatic-critical graphs. J. Graph Theory 45(2): 113-118 (2004) - 2001
- [j14]Eckhard Steffen:
Circular flow numbers of regular multigraphs. J. Graph Theory 36(1): 24-34 (2001) - 2000
- [j13]Hans Georg Carstens, Thomas Dinski, Eckhard Steffen:
Reduction of Symmetric Configurations n3. Discret. Appl. Math. 99(1-3): 401-411 (2000) - [j12]Eckhard Steffen:
A refinement of Vizing's theorem. Discret. Math. 218(1-3): 289-291 (2000)
1990 – 1999
- 1999
- [j11]Eckhard Steffen:
Counterexamples to a conjecture about Petersen-minors in supersnarks. Discret. Math. 207(1-3): 291-292 (1999) - [j10]Stefan Grünewald, Eckhard Steffen:
Cyclically 5-edge connected non-bicritical critical snarks. Discuss. Math. Graph Theory 19(1): 5-11 (1999) - [j9]Eckhard Steffen:
Non-Bicritical Critical Snarks. Graphs Comb. 15(4): 473-480 (1999) - [j8]Stefan Grünewald, Eckhard Steffen:
Chromatic-index-critical graphs of even order. J. Graph Theory 30(1): 27-36 (1999) - 1998
- [j7]Gunnar Brinkmann, Eckhard Steffen:
Snarks and Reducibility. Ars Comb. 50 (1998) - [j6]Eckhard Steffen:
Classifications and characterizations of snarks. Discret. Math. 188(1-3): 183-203 (1998) - [j5]Gunnar Brinkmann, Eckhard Steffen:
Chromatic-Index-Critical Graphs of Orders 11 and 12. Eur. J. Comb. 19(8): 889-900 (1998) - 1997
- [j4]Gunnar Brinkmann, Eckhard Steffen:
3- and 4-critical graphs of small even order. Discret. Math. 169(1-3): 193-197 (1997) - 1996
- [j3]Eckhard Steffen, Xuding Zhu:
Star Chromatic Numbers of Graphs. Comb. 16(3): 439-448 (1996) - [j2]Eckhard Steffen:
Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs. Discret. Math. 161(1-3): 315 (1996) - [j1]Eckhard Steffen:
Tutte's 5-flow conjecture for graphs of nonorientable genus 5. J. Graph Theory 22(4): 309-319 (1996) - 1991
- [b1]Eckhard Steffen:
Die Komplexität von Entscheidungsproblemen in der "Default Logic" und der autoepistemischen Logik. Bielefeld University, Germany, 1991, pp. 1-59
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
