Dalfó, C., et al. “On Token Signed Graphs.” ArXiv:2403.02924, 2024.

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.

Cappello, Chiara, et al. “Critically 3-Frustrated Signed Graphs.” ArXiv:2304.10243, 2023.

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.

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

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.

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.

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.

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.

Gräßler, Iris, et al., editors. The Digital Twin of Humans. Springer International Publishing, 2023, 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.

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.

Li, Jiaao, et al. “Nowhere-Zero 3-Flows in Toroidal Graphs.”10.1016/j.jctb.2021.11.001__Journal of Combinatorial Theory, Series B, vol. 153, Elsevier BV, 2021, pp. 61–80, doi:10.1016/j.jctb.2021.11.001.

Li, Jiaao, et al. “On 3-Flow-Critical Graphs.”10.1016/j.ejc.2021.103451__European Journal of Combinatorics, vol. 100, 103451, Elsevier BV, 2021, doi:10.1016/j.ejc.2021.103451.

Fiol, M. A., et al. “Measures of Edge-Uncolorability of Cubic Graphs.” The Electronic Journal of Combinatorics, vol. 25, no. 4, .54, 2018.

Jin, Ligang, et al. “Cores, Joins  and the Fano-Flow Conjectures.”10.7151/dmgt.1999__Discussiones Mathematicae Graph Theory, vol. 38, 2018, pp. 165–75, doi:10.7151/dmgt.1999.

Steffen, Eckhard. “Approximating Vizing’s Independence Number Conjecture.” Australasian Journal of Combinatorics, vol. 71, no. 1, 2018, pp. 153–60.

Steffen, Eckhard. “Nearly Nowhere-Zero r-Flow Graphs.” Discrete Mathematics, vol. 312, 2012, pp. 2757–59.