Eckhard Steffen

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

69 Publications

Mark all

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

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed

69 Publications

Mark all

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

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed