Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
69 Publications
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
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
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
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
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
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
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
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
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
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
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
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
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
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