Eckhard Steffen

Diskrete Mathematik/Graphentheorie
eckhard.steffen@uni-paderborn.de
ID
15548

70 Publications

Mark all

[70]
2024 | Preprint | LibreCat-ID: 52342
On token signed graphs
C. Dalfó, M.A. Fiol, E. Steffen, ArXiv:2403.02924 (2024).
LibreCat | arXiv
 
[69]
2024 | Journal Article | LibreCat-ID: 49905
Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs
Y. Ma, D. Mattiolo, E. Steffen, I.H. Wolf, Combinatorica 44 (2024) 429–440.
LibreCat | DOI
 
[68]
2024 | Preprint | LibreCat-ID: 55339
Information dissemination and confusion in signed networks
L. Jin, E. Steffen, ArXiv:2407.09796 (2024).
LibreCat | arXiv
 
[67]
2024 | Journal Article | LibreCat-ID: 56497
Critically 3-frustrated signed graphs
C. Cappello, R. Naserasr, E. Steffen, Z. Wang, Discrete Mathematics 348 (2024).
LibreCat | DOI
 
[66]
2023 | Journal Article | LibreCat-ID: 51351
Bounds for the chromatic index of signed multigraphs
E. Steffen, I.H. Wolf, Discrete Applied Mathematics 337 (2023) 185–189.
LibreCat | DOI
 
[65]
2023 | Book Chapter | LibreCat-ID: 45190
Graph-Theoretical Models for the Analysis and Design of Socio-Technical Networks
C. Cappello, E. Steffen, in: The Digital Twin of Humans, Springer International Publishing, Cham, 2023, pp. 93--110.
LibreCat | DOI
 
[64]
2023 | Journal Article | LibreCat-ID: 51357
Rotation r-graphs
E. Steffen, I.H. Wolf, Discrete Mathematics (2023).
LibreCat | DOI
 
[63]
2023 | Book Chapter | LibreCat-ID: 45110
Introduction—The Digital Twin of Humans
I. Gräßler, E. Steffen, G.W. Maier, D. Roesmann, in: I. Gräßler, G.W. Maier, E. Steffen, D. Roesmann (Eds.), The Digital Twin of Humans, Springer International Publishing, Cham, 2023, pp. 3–10.
LibreCat | Files available | DOI
 
[62]
2023 | Book (Editor) | LibreCat-ID: 45191
The Digital Twin of Humans
I. Gräßler, G.W. Maier, E. Steffen, D. Roesmann, eds., The Digital Twin of Humans, Springer International Publishing, Cham, 2023.
LibreCat | DOI
 
[61]
2023 | Journal Article | LibreCat-ID: 44857
Algorithms for the genome median under a restricted measure of rearrangement
H.O.M. Silva, D.P. Rubert, E. Araujo, E. Steffen, D. Doerr, F.V. Martinez, RAIRO - Operations Research 57 (2023) 1045–1058.
LibreCat | DOI
 
[60]
2023 | Preprint | LibreCat-ID: 44859
Sets of r-graphs that color all r-graphs
Y. Ma, D. Mattiolo, E. Steffen, I.H. Wolf, ArXiv:2305.08619 (2023).
LibreCat | arXiv
 
[59]
2023 | Journal Article | LibreCat-ID: 46256
Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs
Y. Ma, D. Mattiolo, E. Steffen, I.H. Wolf, SIAM Journal on Discrete Mathematics 37 (2023) 1548–1565.
LibreCat | DOI
 
[58]
2022 | Journal Article | LibreCat-ID: 33741
Symmetric Set Coloring of Signed Graphs
C. Cappello, E. Steffen, Annals of Combinatorics (2022).
LibreCat | DOI | arXiv
 
[57]
2022 | Journal Article | LibreCat-ID: 31543
Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices
E. Steffen, I.H. Wolf, Graphs and Combinatorics 38 (2022).
LibreCat | DOI | arXiv
 
[56]
2022 | Journal Article | LibreCat-ID: 33950
Frustration-critical signed graphs
C. Cappello, E. Steffen, Discrete Applied Mathematics 322 (2022) 183–193.
LibreCat | DOI | arXiv
 
[55]
2022 | Journal Article | LibreCat-ID: 26408
Edge colorings and circular flows on regular graphs
D. Mattiolo, E. Steffen, Journal of Graph Theory 99 (2022) 399–413.
LibreCat | DOI | arXiv
 
[54]
2021 | Conference Paper | LibreCat-ID: 22287
Skill-based worker assignment in a manual assembly line
I. Gräßler, D. Roesmann, C. Cappello, E. Steffen, in: E. Lutters (Ed.), Procedia CIRP Design, Elsevier, 2021, pp. 433–438.
LibreCat | DOI
 
[53]
2021 | Journal Article | LibreCat-ID: 23456
Highly edge‐connected regular graphs without large factorizable subgraphs
D. Mattiolo, E. Steffen, Journal of Graph Theory 99 (2021) 107–116.
LibreCat | DOI | arXiv
 
[52]
2021 | Journal Article | LibreCat-ID: 21827
Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs
A. Klopp, E. Steffen, Graphs and Combinatorics (2021) 559–580.
LibreCat | DOI | arXiv
 
[51]
2021 | Journal Article | LibreCat-ID: 13445
Concepts of signed graph coloring
E. Steffen, A. Vogel, European J. Combinatorics 91 (2021).
LibreCat | arXiv
 
[50]
2020 | Journal Article | LibreCat-ID: 13114
Flows on signed graphs without long barbells
Y. Lu, R. Luo, M. Schubert, E. Steffen, C.-Q. Zhang, SIAM J. Discrete Math 34 (4) (2020) 2166–2187.
LibreCat | DOI | arXiv
 
[49]
2020 | Journal Article | LibreCat-ID: 12971
Unions of 1-factors in r-graphs and overfull graphs
L. Jin, E. Steffen, J. of Combinatorics 11 (2020) 457–473.
LibreCat | arXiv
 
[48]
2018 | Book Chapter | LibreCat-ID: 16938
Gerechtigkeit in flexiblen Arbeits- und Managementprozessen
G. Engels, G.W. Maier, S.K. Ötting, E. Steffen, A. Teetz, in: S. Wischmann, E.A. Hartmann (Eds.), Zukunft Der Arbeit – Eine Praxisnahe Betrachtung, Springer Verlag, Berlin, Heidelberg, 2018, pp. 221–231.
LibreCat | DOI
 
[47]
2018 | Journal Article | LibreCat-ID: 10129
Measures of Edge-Uncolorability of Cubic Graphs
M.A. Fiol, G. Mazzuoccolo, E. Steffen, The Electronic Journal of Combinatorics 25 (2018).
LibreCat
 
[46]
2018 | Journal Article | LibreCat-ID: 10130
Flows in Signed Graphs with Two Negative Edges
E. Rollová, M. Schubert, E. Steffen, The Electronic Journal of Combinatorics 25 (2018).
LibreCat | DOI
 
[45]
2018 | Journal Article | LibreCat-ID: 10132
Cores, joins and the Fano-flow conjectures
L. Jin, G. Mazzuoccolo, E. Steffen, Discussiones Mathematicae Graph Theory 38 (2018) 165–175.
LibreCat | DOI
 
[44]
2018 | Journal Article | LibreCat-ID: 10142
Approximating Vizing’s independence number conjecture
E. Steffen, Australasian Journal of Combinatorics 71 (2018) 153–160.
LibreCat
 
[43]
2017 | Book (Editor) | LibreCat-ID: 10146
Handbuch Gestaltung digitaler und vernetzter Arbeitswelten
G.W. Maier, G. Engels, E. Steffen, eds., Handbuch Gestaltung digitaler und vernetzter Arbeitswelten, 1st ed., Springer Berlin Heidelberg, 2017.
LibreCat
 
[42]
2017 | Book Chapter | LibreCat-ID: 10147
Digitale Zukunft: ein inter- und transdisziplinäres Thema
D. Simon, E. Steffen, in: G.W. Maier, G. Engels, E. Steffen (Eds.), Handbuch Gestaltung digitaler und vernetzter Arbeitswelten, 1st ed., Springer Berlin Heidelberg, 2017, pp. 1–12.
LibreCat
 
[41]
2017 | Journal Article | LibreCat-ID: 10155
Nowhere-zero 5-flows on cubic graphs with oddness 4
G. Mazzuoccolo, E. Steffen, J. Graph Theory 85 (2017) 363 – 371.
LibreCat
 
[40]
2017 | Journal Article | LibreCat-ID: 10156
Factors of edge-chromatic critical graphs: a brief survey and some equivalences
S. Bej, E. Steffen, Lecture Notes of Seminario Interdisciplinare Di Matematica 14 (2017) 37–48.
LibreCat
 
[39]
2017 | Journal Article | LibreCat-ID: 10157
Petersen cores and the oddness of cubic graphs
L. Jin, E. Steffen, J. Graph Theory 84 (2017) 109–120.
LibreCat
 
[38]
2016 | Journal Article | LibreCat-ID: 10158
Face-degree bounds for planar critical graphs
L. Jin, Y. Kang, E. Steffen, Electronic Journal of Combinatorics 23 (2016).
LibreCat
 
[37]
2016 | Journal Article | LibreCat-ID: 10159
The chromatic spectrum of signed graphs
Y. Kang, E. Steffen, Discrete Mathematics 339 (2016) 234–243.
LibreCat
 
[36]
2016 | Journal Article | LibreCat-ID: 10160
Remarks on planar critical graphs
L. Jin, Y. Kang, E. Steffen, Discrete Applied Mathematics 200 (2016) 200–202.
LibreCat
 
[35]
2016 | Journal Article | LibreCat-ID: 10161
Choosability in signed planar graphs
L. Jin, Y. Kang, E. Steffen, European J. Combinatorics 52 (2016) 234–243.
LibreCat
 
[34]
2015 | Journal Article | LibreCat-ID: 10162
Intersecting 1-factors and nowhere-zero 5-flows
E. Steffen, Combinatorica 35 (2015) 633–640.
LibreCat
 
[33]
2015 | Journal Article | LibreCat-ID: 10163
Edge-colorings and circular flow numbers of regular graphs
E. Steffen, J. Graph Theory 79 (2015) 1–7.
LibreCat
 
[32]
2015 | Journal Article | LibreCat-ID: 10164
The difference between the circular and the integer flow number of bidirected graphs
E. Máčajová, E. Steffen, Discrete Mathematics 338 (2015) 866–867.
LibreCat
 
[31]
2015 | Journal Article | LibreCat-ID: 10165
1-factor-and cycle covers of cubic graphs
E. Steffen, J. Graph Theory 78 (2015) 195 – 206.
LibreCat
 
[30]
2015 | Journal Article | LibreCat-ID: 10166
Nowhere-zero flows on signed regular graphs
M. Schubert, E. Steffen, European J. Combinatorics 48 (2015) 34–47.
LibreCat
 
[29]
2014 | Journal Article | LibreCat-ID: 10167
The set of circular flow numbers of regular graphs
M. Schubert, E. Steffen, J. Graph Theory 76 (2014) 297–308.
LibreCat
 
[28]
2014 | Journal Article | LibreCat-ID: 10169
Petersen colorings and some families of snarks
J. Hägglund, E. Steffen, Ars Mathematica Contemporanea 312 (2014) 476–478.
LibreCat
 
[27]
2012 | Journal Article | LibreCat-ID: 10170
α-labelings and the structure of trees with nonzero α-deficit
G. Brinkmann, Simon Crevals, H. Melot, Leanne J. Rylands, E. Steffen, Discrete Mathematics. and Theoretical Computer Science 14.1 (2012) 159–174.
LibreCat
 
[26]
2012 | Journal Article | LibreCat-ID: 10171
Nearly nowhere-zero r-flow graphs
E. Steffen, Discrete Mathematics 312 (2012) 2757–2759.
LibreCat
 
[25]
2012 | Journal Article | LibreCat-ID: 10172
Maximum Δ-edge-colorable subgraphs of class II graphs
V. Mkrtchyan, E. Steffen, J. Graph Theory 70 (2012) 473–482.
LibreCat
 
[24]
2012 | Journal Article | LibreCat-ID: 10173
Measures of edge-uncolorability
V. Mkrtchyan, E. Steffen, Discrete Mathematics 312 (2012) 476–478.
LibreCat
 
[23]
2010 | Journal Article | LibreCat-ID: 10174
Tutte's 5-flow conjecture for cyclically highly connected cubic graphs
E. Steffen, Discrete Mathematics 310 (2010) 385–389.
LibreCat
 
[22]
2010 | Preprint | LibreCat-ID: 10202
Bricks and conjectures of Berge, Fulkerson and Seymour
V. Mkrtchyan, E. Steffen, ArXiv:1003.5782 (2010).
LibreCat
 
[21]
2008 | Journal Article | LibreCat-ID: 10175
Relating embedding and coloring properties of snarks
B. Mohar, E. Steffen, A. Vodopivec, Ars Mathematica Contemporanea 1 (2008) 169–184.
LibreCat
 
[20]
2006 | Journal Article | LibreCat-ID: 10176
Erratum to „Reductions of Symmetry configurations n3
M. Boben, T. Pisanski, N. Ravnik, E. Steffen, Discrete Applied Mathematics 154 (2006) 1645–1646.
LibreCat
 
[19]
2004 | Journal Article | LibreCat-ID: 10177
Measurements of edge-uncolorability
E. Steffen, Discrete Mathematics 280 (2004) 191–214.
LibreCat
 
[18]
2004 | Journal Article | LibreCat-ID: 10178
Independent Sets and 2-factors in edge-chromatic critical graphs
S. Grünewald, E. Steffen, J. Graph Theory 45 (2004) 113–118.
LibreCat
 
[17]
2001 | Journal Article | LibreCat-ID: 10179
Circular flow numbers of regular multigraphs
E. Steffen, J. Graph Theory 36 (2001) 24–34.
LibreCat
 
[16]
2001 | Journal Article | LibreCat-ID: 10180
On bicritical snarks
E. Steffen, Math. Slovaca 51 (2001) 141–150.
LibreCat
 
[15]
2000 | Journal Article | LibreCat-ID: 10182
Bounds for the independence number of critical graphs
G. Brinkmann, S.A. Choudum, S. Grünewald, E. Steffen, Bull. London Math. Soc. 32 (2000) 137–140.
LibreCat
 
[14]
2000 | Journal Article | LibreCat-ID: 10183
A refinement of Vizing's theorem
E. Steffen, Discrete Mathematics 218 (2000) 289–291.
LibreCat
 
[13]
2000 | Journal Article | LibreCat-ID: 10186
Reductions of Symmetry configurations n3
H.G. Carstens, T. Dinski, E. Steffen, Discrete Applied Mathematics 99 (2000) 401–411.
LibreCat
 
[12]
1999 | Journal Article | LibreCat-ID: 10187
Counterexamples to a conjecture about Petersen-minors in supersnarks
E. Steffen, Discrete Mathematics 207 (1999) 291–292.
LibreCat
 
[11]
1999 | Journal Article | LibreCat-ID: 10189
Non-bicritical critical snarks
E. Steffen, Graphs Comb. 15 (1999) 473–480.
LibreCat
 
[10]
1999 | Journal Article | LibreCat-ID: 10190
Cyclically 5-edge connected non-bicritical critical snarks
S. Grünewald, E. Steffen, Discuss. Math. Graph Theory 19 (1999) 5–11.
LibreCat
 
[9]
1999 | Journal Article | LibreCat-ID: 10191
Chromatic-index-critical graphs of even order
S. Grünewald, E. Steffen, J. Graph Theory 30 (1999) 27–36.
LibreCat
 
[8]
1998 | Journal Article | LibreCat-ID: 10193
Snarks and reducibility
G. Brinkmann, E. Steffen, Ars Combinatoria 50 (1998) 292–296.
LibreCat
 
[7]
1998 | Journal Article | LibreCat-ID: 10194
Chromatic-index-critical graphs of Orders 11 and 12
G. Brinkmann, E. Steffen, European J. Combinatorics 19 (1998) 889–900.
LibreCat
 
[6]
1998 | Journal Article | LibreCat-ID: 10195
Classification and characterizations of snarkse
E. Steffen, Discrete Mathematics 188 (1998) 183-203 (.
LibreCat
 
[5]
1997 | Journal Article | LibreCat-ID: 10196
3- and 4-critical graphs of small even order
G. Brinkmann, E. Steffen, Discrete Mathematics 188 (1997) 193–197.
LibreCat
 
[4]
1996 | Journal Article | LibreCat-ID: 10197
Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs
E. Steffen, Discrete Mathematics 161 (1996) 315.
LibreCat
 
[3]
1996 | Journal Article | LibreCat-ID: 10198
Star chromatic numbers of graphs
E. Steffen, X. Zhu, Combinatorica 16 (1996) 439–448.
LibreCat
 
[2]
1996 | Journal Article | LibreCat-ID: 10199
Tutte's 5-flow conjecture for graphs of non-orientable genus 5
E. Steffen, J. Graph Theory 22 (1996) 309–319.
LibreCat
 
[1]
1992 | Conference Paper | LibreCat-ID: 10201
Complexity results for the default- and autoepistemic logic
E. Steffen, in: E. Börger (Ed.), Computer Science Logic , Springer Berlin Heidelberg, 1992, pp. 339–352.
LibreCat
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Export / Embed

70 Publications

Mark all

[70]
2024 | Preprint | LibreCat-ID: 52342
On token signed graphs
C. Dalfó, M.A. Fiol, E. Steffen, ArXiv:2403.02924 (2024).
LibreCat | arXiv
 
[69]
2024 | Journal Article | LibreCat-ID: 49905
Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs
Y. Ma, D. Mattiolo, E. Steffen, I.H. Wolf, Combinatorica 44 (2024) 429–440.
LibreCat | DOI
 
[68]
2024 | Preprint | LibreCat-ID: 55339
Information dissemination and confusion in signed networks
L. Jin, E. Steffen, ArXiv:2407.09796 (2024).
LibreCat | arXiv
 
[67]
2024 | Journal Article | LibreCat-ID: 56497
Critically 3-frustrated signed graphs
C. Cappello, R. Naserasr, E. Steffen, Z. Wang, Discrete Mathematics 348 (2024).
LibreCat | DOI
 
[66]
2023 | Journal Article | LibreCat-ID: 51351
Bounds for the chromatic index of signed multigraphs
E. Steffen, I.H. Wolf, Discrete Applied Mathematics 337 (2023) 185–189.
LibreCat | DOI
 
[65]
2023 | Book Chapter | LibreCat-ID: 45190
Graph-Theoretical Models for the Analysis and Design of Socio-Technical Networks
C. Cappello, E. Steffen, in: The Digital Twin of Humans, Springer International Publishing, Cham, 2023, pp. 93--110.
LibreCat | DOI
 
[64]
2023 | Journal Article | LibreCat-ID: 51357
Rotation r-graphs
E. Steffen, I.H. Wolf, Discrete Mathematics (2023).
LibreCat | DOI
 
[63]
2023 | Book Chapter | LibreCat-ID: 45110
Introduction—The Digital Twin of Humans
I. Gräßler, E. Steffen, G.W. Maier, D. Roesmann, in: I. Gräßler, G.W. Maier, E. Steffen, D. Roesmann (Eds.), The Digital Twin of Humans, Springer International Publishing, Cham, 2023, pp. 3–10.
LibreCat | Files available | DOI
 
[62]
2023 | Book (Editor) | LibreCat-ID: 45191
The Digital Twin of Humans
I. Gräßler, G.W. Maier, E. Steffen, D. Roesmann, eds., The Digital Twin of Humans, Springer International Publishing, Cham, 2023.
LibreCat | DOI
 
[61]
2023 | Journal Article | LibreCat-ID: 44857
Algorithms for the genome median under a restricted measure of rearrangement
H.O.M. Silva, D.P. Rubert, E. Araujo, E. Steffen, D. Doerr, F.V. Martinez, RAIRO - Operations Research 57 (2023) 1045–1058.
LibreCat | DOI
 
[60]
2023 | Preprint | LibreCat-ID: 44859
Sets of r-graphs that color all r-graphs
Y. Ma, D. Mattiolo, E. Steffen, I.H. Wolf, ArXiv:2305.08619 (2023).
LibreCat | arXiv
 
[59]
2023 | Journal Article | LibreCat-ID: 46256
Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs
Y. Ma, D. Mattiolo, E. Steffen, I.H. Wolf, SIAM Journal on Discrete Mathematics 37 (2023) 1548–1565.
LibreCat | DOI
 
[58]
2022 | Journal Article | LibreCat-ID: 33741
Symmetric Set Coloring of Signed Graphs
C. Cappello, E. Steffen, Annals of Combinatorics (2022).
LibreCat | DOI | arXiv
 
[57]
2022 | Journal Article | LibreCat-ID: 31543
Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices
E. Steffen, I.H. Wolf, Graphs and Combinatorics 38 (2022).
LibreCat | DOI | arXiv
 
[56]
2022 | Journal Article | LibreCat-ID: 33950
Frustration-critical signed graphs
C. Cappello, E. Steffen, Discrete Applied Mathematics 322 (2022) 183–193.
LibreCat | DOI | arXiv
 
[55]
2022 | Journal Article | LibreCat-ID: 26408
Edge colorings and circular flows on regular graphs
D. Mattiolo, E. Steffen, Journal of Graph Theory 99 (2022) 399–413.
LibreCat | DOI | arXiv
 
[54]
2021 | Conference Paper | LibreCat-ID: 22287
Skill-based worker assignment in a manual assembly line
I. Gräßler, D. Roesmann, C. Cappello, E. Steffen, in: E. Lutters (Ed.), Procedia CIRP Design, Elsevier, 2021, pp. 433–438.
LibreCat | DOI
 
[53]
2021 | Journal Article | LibreCat-ID: 23456
Highly edge‐connected regular graphs without large factorizable subgraphs
D. Mattiolo, E. Steffen, Journal of Graph Theory 99 (2021) 107–116.
LibreCat | DOI | arXiv
 
[52]
2021 | Journal Article | LibreCat-ID: 21827
Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs
A. Klopp, E. Steffen, Graphs and Combinatorics (2021) 559–580.
LibreCat | DOI | arXiv
 
[51]
2021 | Journal Article | LibreCat-ID: 13445
Concepts of signed graph coloring
E. Steffen, A. Vogel, European J. Combinatorics 91 (2021).
LibreCat | arXiv
 
[50]
2020 | Journal Article | LibreCat-ID: 13114
Flows on signed graphs without long barbells
Y. Lu, R. Luo, M. Schubert, E. Steffen, C.-Q. Zhang, SIAM J. Discrete Math 34 (4) (2020) 2166–2187.
LibreCat | DOI | arXiv
 
[49]
2020 | Journal Article | LibreCat-ID: 12971
Unions of 1-factors in r-graphs and overfull graphs
L. Jin, E. Steffen, J. of Combinatorics 11 (2020) 457–473.
LibreCat | arXiv
 
[48]
2018 | Book Chapter | LibreCat-ID: 16938
Gerechtigkeit in flexiblen Arbeits- und Managementprozessen
G. Engels, G.W. Maier, S.K. Ötting, E. Steffen, A. Teetz, in: S. Wischmann, E.A. Hartmann (Eds.), Zukunft Der Arbeit – Eine Praxisnahe Betrachtung, Springer Verlag, Berlin, Heidelberg, 2018, pp. 221–231.
LibreCat | DOI
 
[47]
2018 | Journal Article | LibreCat-ID: 10129
Measures of Edge-Uncolorability of Cubic Graphs
M.A. Fiol, G. Mazzuoccolo, E. Steffen, The Electronic Journal of Combinatorics 25 (2018).
LibreCat
 
[46]
2018 | Journal Article | LibreCat-ID: 10130
Flows in Signed Graphs with Two Negative Edges
E. Rollová, M. Schubert, E. Steffen, The Electronic Journal of Combinatorics 25 (2018).
LibreCat | DOI
 
[45]
2018 | Journal Article | LibreCat-ID: 10132
Cores, joins and the Fano-flow conjectures
L. Jin, G. Mazzuoccolo, E. Steffen, Discussiones Mathematicae Graph Theory 38 (2018) 165–175.
LibreCat | DOI
 
[44]
2018 | Journal Article | LibreCat-ID: 10142
Approximating Vizing’s independence number conjecture
E. Steffen, Australasian Journal of Combinatorics 71 (2018) 153–160.
LibreCat
 
[43]
2017 | Book (Editor) | LibreCat-ID: 10146
Handbuch Gestaltung digitaler und vernetzter Arbeitswelten
G.W. Maier, G. Engels, E. Steffen, eds., Handbuch Gestaltung digitaler und vernetzter Arbeitswelten, 1st ed., Springer Berlin Heidelberg, 2017.
LibreCat
 
[42]
2017 | Book Chapter | LibreCat-ID: 10147
Digitale Zukunft: ein inter- und transdisziplinäres Thema
D. Simon, E. Steffen, in: G.W. Maier, G. Engels, E. Steffen (Eds.), Handbuch Gestaltung digitaler und vernetzter Arbeitswelten, 1st ed., Springer Berlin Heidelberg, 2017, pp. 1–12.
LibreCat
 
[41]
2017 | Journal Article | LibreCat-ID: 10155
Nowhere-zero 5-flows on cubic graphs with oddness 4
G. Mazzuoccolo, E. Steffen, J. Graph Theory 85 (2017) 363 – 371.
LibreCat
 
[40]
2017 | Journal Article | LibreCat-ID: 10156
Factors of edge-chromatic critical graphs: a brief survey and some equivalences
S. Bej, E. Steffen, Lecture Notes of Seminario Interdisciplinare Di Matematica 14 (2017) 37–48.
LibreCat
 
[39]
2017 | Journal Article | LibreCat-ID: 10157
Petersen cores and the oddness of cubic graphs
L. Jin, E. Steffen, J. Graph Theory 84 (2017) 109–120.
LibreCat
 
[38]
2016 | Journal Article | LibreCat-ID: 10158
Face-degree bounds for planar critical graphs
L. Jin, Y. Kang, E. Steffen, Electronic Journal of Combinatorics 23 (2016).
LibreCat
 
[37]
2016 | Journal Article | LibreCat-ID: 10159
The chromatic spectrum of signed graphs
Y. Kang, E. Steffen, Discrete Mathematics 339 (2016) 234–243.
LibreCat
 
[36]
2016 | Journal Article | LibreCat-ID: 10160
Remarks on planar critical graphs
L. Jin, Y. Kang, E. Steffen, Discrete Applied Mathematics 200 (2016) 200–202.
LibreCat
 
[35]
2016 | Journal Article | LibreCat-ID: 10161
Choosability in signed planar graphs
L. Jin, Y. Kang, E. Steffen, European J. Combinatorics 52 (2016) 234–243.
LibreCat
 
[34]
2015 | Journal Article | LibreCat-ID: 10162
Intersecting 1-factors and nowhere-zero 5-flows
E. Steffen, Combinatorica 35 (2015) 633–640.
LibreCat
 
[33]
2015 | Journal Article | LibreCat-ID: 10163
Edge-colorings and circular flow numbers of regular graphs
E. Steffen, J. Graph Theory 79 (2015) 1–7.
LibreCat
 
[32]
2015 | Journal Article | LibreCat-ID: 10164
The difference between the circular and the integer flow number of bidirected graphs
E. Máčajová, E. Steffen, Discrete Mathematics 338 (2015) 866–867.
LibreCat
 
[31]
2015 | Journal Article | LibreCat-ID: 10165
1-factor-and cycle covers of cubic graphs
E. Steffen, J. Graph Theory 78 (2015) 195 – 206.
LibreCat
 
[30]
2015 | Journal Article | LibreCat-ID: 10166
Nowhere-zero flows on signed regular graphs
M. Schubert, E. Steffen, European J. Combinatorics 48 (2015) 34–47.
LibreCat
 
[29]
2014 | Journal Article | LibreCat-ID: 10167
The set of circular flow numbers of regular graphs
M. Schubert, E. Steffen, J. Graph Theory 76 (2014) 297–308.
LibreCat
 
[28]
2014 | Journal Article | LibreCat-ID: 10169
Petersen colorings and some families of snarks
J. Hägglund, E. Steffen, Ars Mathematica Contemporanea 312 (2014) 476–478.
LibreCat
 
[27]
2012 | Journal Article | LibreCat-ID: 10170
α-labelings and the structure of trees with nonzero α-deficit
G. Brinkmann, Simon Crevals, H. Melot, Leanne J. Rylands, E. Steffen, Discrete Mathematics. and Theoretical Computer Science 14.1 (2012) 159–174.
LibreCat
 
[26]
2012 | Journal Article | LibreCat-ID: 10171
Nearly nowhere-zero r-flow graphs
E. Steffen, Discrete Mathematics 312 (2012) 2757–2759.
LibreCat
 
[25]
2012 | Journal Article | LibreCat-ID: 10172
Maximum Δ-edge-colorable subgraphs of class II graphs
V. Mkrtchyan, E. Steffen, J. Graph Theory 70 (2012) 473–482.
LibreCat
 
[24]
2012 | Journal Article | LibreCat-ID: 10173
Measures of edge-uncolorability
V. Mkrtchyan, E. Steffen, Discrete Mathematics 312 (2012) 476–478.
LibreCat
 
[23]
2010 | Journal Article | LibreCat-ID: 10174
Tutte's 5-flow conjecture for cyclically highly connected cubic graphs
E. Steffen, Discrete Mathematics 310 (2010) 385–389.
LibreCat
 
[22]
2010 | Preprint | LibreCat-ID: 10202
Bricks and conjectures of Berge, Fulkerson and Seymour
V. Mkrtchyan, E. Steffen, ArXiv:1003.5782 (2010).
LibreCat
 
[21]
2008 | Journal Article | LibreCat-ID: 10175
Relating embedding and coloring properties of snarks
B. Mohar, E. Steffen, A. Vodopivec, Ars Mathematica Contemporanea 1 (2008) 169–184.
LibreCat
 
[20]
2006 | Journal Article | LibreCat-ID: 10176
Erratum to „Reductions of Symmetry configurations n3
M. Boben, T. Pisanski, N. Ravnik, E. Steffen, Discrete Applied Mathematics 154 (2006) 1645–1646.
LibreCat
 
[19]
2004 | Journal Article | LibreCat-ID: 10177
Measurements of edge-uncolorability
E. Steffen, Discrete Mathematics 280 (2004) 191–214.
LibreCat
 
[18]
2004 | Journal Article | LibreCat-ID: 10178
Independent Sets and 2-factors in edge-chromatic critical graphs
S. Grünewald, E. Steffen, J. Graph Theory 45 (2004) 113–118.
LibreCat
 
[17]
2001 | Journal Article | LibreCat-ID: 10179
Circular flow numbers of regular multigraphs
E. Steffen, J. Graph Theory 36 (2001) 24–34.
LibreCat
 
[16]
2001 | Journal Article | LibreCat-ID: 10180
On bicritical snarks
E. Steffen, Math. Slovaca 51 (2001) 141–150.
LibreCat
 
[15]
2000 | Journal Article | LibreCat-ID: 10182
Bounds for the independence number of critical graphs
G. Brinkmann, S.A. Choudum, S. Grünewald, E. Steffen, Bull. London Math. Soc. 32 (2000) 137–140.
LibreCat
 
[14]
2000 | Journal Article | LibreCat-ID: 10183
A refinement of Vizing's theorem
E. Steffen, Discrete Mathematics 218 (2000) 289–291.
LibreCat
 
[13]
2000 | Journal Article | LibreCat-ID: 10186
Reductions of Symmetry configurations n3
H.G. Carstens, T. Dinski, E. Steffen, Discrete Applied Mathematics 99 (2000) 401–411.
LibreCat
 
[12]
1999 | Journal Article | LibreCat-ID: 10187
Counterexamples to a conjecture about Petersen-minors in supersnarks
E. Steffen, Discrete Mathematics 207 (1999) 291–292.
LibreCat
 
[11]
1999 | Journal Article | LibreCat-ID: 10189
Non-bicritical critical snarks
E. Steffen, Graphs Comb. 15 (1999) 473–480.
LibreCat
 
[10]
1999 | Journal Article | LibreCat-ID: 10190
Cyclically 5-edge connected non-bicritical critical snarks
S. Grünewald, E. Steffen, Discuss. Math. Graph Theory 19 (1999) 5–11.
LibreCat
 
[9]
1999 | Journal Article | LibreCat-ID: 10191
Chromatic-index-critical graphs of even order
S. Grünewald, E. Steffen, J. Graph Theory 30 (1999) 27–36.
LibreCat
 
[8]
1998 | Journal Article | LibreCat-ID: 10193
Snarks and reducibility
G. Brinkmann, E. Steffen, Ars Combinatoria 50 (1998) 292–296.
LibreCat
 
[7]
1998 | Journal Article | LibreCat-ID: 10194
Chromatic-index-critical graphs of Orders 11 and 12
G. Brinkmann, E. Steffen, European J. Combinatorics 19 (1998) 889–900.
LibreCat
 
[6]
1998 | Journal Article | LibreCat-ID: 10195
Classification and characterizations of snarkse
E. Steffen, Discrete Mathematics 188 (1998) 183-203 (.
LibreCat
 
[5]
1997 | Journal Article | LibreCat-ID: 10196
3- and 4-critical graphs of small even order
G. Brinkmann, E. Steffen, Discrete Mathematics 188 (1997) 193–197.
LibreCat
 
[4]
1996 | Journal Article | LibreCat-ID: 10197
Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs
E. Steffen, Discrete Mathematics 161 (1996) 315.
LibreCat
 
[3]
1996 | Journal Article | LibreCat-ID: 10198
Star chromatic numbers of graphs
E. Steffen, X. Zhu, Combinatorica 16 (1996) 439–448.
LibreCat
 
[2]
1996 | Journal Article | LibreCat-ID: 10199
Tutte's 5-flow conjecture for graphs of non-orientable genus 5
E. Steffen, J. Graph Theory 22 (1996) 309–319.
LibreCat
 
[1]
1992 | Conference Paper | LibreCat-ID: 10201
Complexity results for the default- and autoepistemic logic
E. Steffen, in: E. Börger (Ed.), Computer Science Logic , Springer Berlin Heidelberg, 1992, pp. 339–352.
LibreCat
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Export / Embed