Dalfó, C., et al. “On Token Signed Graphs.” ArXiv:2403.02924, 2024.
LibreCat: /record/52342
arXiv: 2403.02924

Ma, Yulai, et al. “Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs.”10.1007/s00493-023-00078-9__Combinatorica, vol. 44, Springer Science and Business Media LLC, 2024, pp. 429–40, doi:10.1007/s00493-023-00078-9.
LibreCat: /record/49905
DOI: 10.1007/s00493-023-00078-9

Cappello, Chiara, et al. “Critically 3-Frustrated Signed Graphs.” ArXiv:2304.10243, 2023.
LibreCat: /record/44501
arXiv: 2304.10243

Silva, Helmuth O. M., et al. “Algorithms for the Genome Median under a Restricted Measure of Rearrangement.”10.1051/ro/2023052__RAIRO - Operations Research, vol. 57, no. 3, EDP Sciences, 2023, pp. 1045–58, doi:10.1051/ro/2023052.
LibreCat: /record/44857
DOI: 10.1051/ro/2023052

Ma, Yulai, et al. “Sets of R-Graphs That Color All r-Graphs.” ArXiv:2305.08619, 2023.
LibreCat: /record/44859
arXiv: 2305.08619

Ma, Yulai, et al. “Pairwise Disjoint Perfect Matchings in R-Edge-Connected r-Regular Graphs.”10.1137/22m1500654__SIAM Journal on Discrete Mathematics, vol. 37, no. 3, Society for Industrial &; Applied Mathematics (SIAM), 2023, pp. 1548–65, doi:10.1137/22m1500654.
LibreCat: /record/46256
DOI: 10.1137/22m1500654

Steffen, Eckhard, and Isaak Hieronymus Wolf. “Bounds for the Chromatic Index of Signed Multigraphs.”10.1016/j.dam.2023.05.008__Discrete Applied Mathematics, vol. 337, Elsevier BV, 2023, pp. 185–89, doi:10.1016/j.dam.2023.05.008.
LibreCat: /record/51351
DOI: 10.1016/j.dam.2023.05.008

Cappello, Chiara, and Eckhard Steffen. “Graph-Theoretical Models for the Analysis and Design of Socio-Technical Networks.”10.1007/978-3-031-26104-6_5__The Digital Twin of Humans, Springer International Publishing, 2023, pp. 93--110, doi:10.1007/978-3-031-26104-6_5.
LibreCat: /record/45190
DOI: 10.1007/978-3-031-26104-6_5

Steffen, Eckhard, and Isaak Hieronymus Wolf. “Rotation R-Graphs.”10.1016/j.disc.2023.113457__Discrete Mathematics, 113457, Elsevier BV, 2023, doi:10.1016/j.disc.2023.113457.
LibreCat: /record/51357
DOI: 10.1016/j.disc.2023.113457

Gräßler, Iris, et al. “Introduction—The Digital Twin of Humans.”10.1007/978-3-031-26104-6_1__The Digital Twin of Humans, edited by Iris Gräßler et al., Springer International Publishing, 2023, pp. 3–10, doi:10.1007/978-3-031-26104-6_1.
LibreCat: /record/45110
DOI: 10.1007/978-3-031-26104-6_1

Gräßler, Iris, et al., editors. The Digital Twin of Humans. Springer International Publishing, 2023, doi:10.1007/978-3-031-26104-6.
LibreCat: /record/45191
DOI: 10.1007/978-3-031-26104-6

Cappello, Chiara, and Eckhard Steffen. “Symmetric Set Coloring of Signed Graphs.”10.1007/s00026-022-00593-4__Annals of Combinatorics, Springer Science and Business Media LLC, 2022, doi:10.1007/s00026-022-00593-4.
LibreCat: /record/33741
DOI: 10.1007/s00026-022-00593-4
arXiv: 2106.05928

Steffen, Eckhard, and Isaak Hieronymus Wolf. “Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices.”10.1007/s00373-022-02506-x__Graphs and Combinatorics, vol. 38, no. 3, 104, Springer Science and Business Media LLC, 2022, doi:10.1007/s00373-022-02506-x.
LibreCat: /record/31543
DOI: 10.1007/s00373-022-02506-x
arXiv: 2109.11447

Cappello, Chiara, and Eckhard Steffen. “Frustration-Critical Signed Graphs.”10.1016/j.dam.2022.08.010__Discrete Applied Mathematics, vol. 322, Elsevier BV, 2022, pp. 183–93, doi:10.1016/j.dam.2022.08.010.
LibreCat: /record/33950
DOI: 10.1016/j.dam.2022.08.010
arXiv: 2112.02664

Mattiolo, Davide, and Eckhard Steffen. “Edge Colorings and Circular Flows on Regular Graphs.”10.1002/jgt.22746__Journal of Graph Theory, vol. 99, no. 3, 2022, pp. 399–413, doi:10.1002/jgt.22746.
LibreCat: /record/26408
DOI: 10.1002/jgt.22746
arXiv: 2001.02484

Gräßler, Iris, et al. “Skill-Based Worker Assignment in a Manual Assembly Line.”10.1016/j.procir.2021.05.100__Procedia CIRP Design, edited by Eric Lutters, Elsevier, 2021, pp. 433–38, doi:10.1016/j.procir.2021.05.100.
LibreCat: /record/22287
DOI: 10.1016/j.procir.2021.05.100

Mattiolo, Davide, and Eckhard Steffen. “Highly Edgeconnected Regular Graphs without Large Factorizable Subgraphs.”10.1002/jgt.22729__Journal of Graph Theory, vol. 99, no. 1, 2021, pp. 107–16, doi:10.1002/jgt.22729.
LibreCat: /record/23456
DOI: 10.1002/jgt.22729
arXiv: 1912.09704

Klopp, Antje, and Eckhard Steffen. “Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs.”10.1007/s00373-020-02266-6__Graphs and Combinatorics, 2021, pp. 559–80, doi:10.1007/s00373-020-02266-6.
LibreCat: /record/21827
DOI: 10.1007/s00373-020-02266-6
arXiv: 1903.12385

Steffen, Eckhard, and Alexander Vogel. “Concepts of Signed Graph Coloring.” European J. Combinatorics, vol. 91, 2021.
LibreCat: /record/13445
arXiv: 1909.09381

Lu, You, et al. “Flows on Signed Graphs without Long Barbells.”10.1137/18M1222818__SIAM J. Discrete Math, vol. 34 (4), 2020, pp. 2166–87, doi:10.1137/18M1222818.
LibreCat: /record/13114
DOI: 10.1137/18M1222818
arXiv: 1908.11004