@article{49905,
  abstract     = {{For 0 ≤ t ≤ r let m(t, r) be the maximum number s such that every t-edge-connected r-graph has s pairwise disjoint perfect matchings. There are only a few values of m(t, r) known, for instance m(3, 3) = m(4, r) = 1, and m(t, r) ≤ r − 2 for all t  = 5,
and m(t, r) ≤ r − 3 if r is even. We prove that m(2l, r) ≤ 3l − 6 for every l ≥ 3 and r ≥ 2l.}},
  author       = {{Ma, Yulai and Mattiolo, Davide and Steffen, Eckhard and Wolf, Isaak Hieronymus}},
  issn         = {{0209-9683}},
  journal      = {{Combinatorica}},
  keywords     = {{Computational Mathematics, Discrete Mathematics and Combinatorics}},
  pages        = {{429--440}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs}}},
  doi          = {{10.1007/s00493-023-00078-9}},
  volume       = {{44}},
  year         = {{2024}},
}

@article{51351,
  author       = {{Steffen, Eckhard and Wolf, Isaak Hieronymus}},
  issn         = {{0166-218X}},
  journal      = {{Discrete Applied Mathematics}},
  keywords     = {{Applied Mathematics, Discrete Mathematics and Combinatorics}},
  pages        = {{185--189}},
  publisher    = {{Elsevier BV}},
  title        = {{{Bounds for the chromatic index of signed multigraphs}}},
  doi          = {{10.1016/j.dam.2023.05.008}},
  volume       = {{337}},
  year         = {{2023}},
}

@article{51357,
  author       = {{Steffen, Eckhard and Wolf, Isaak Hieronymus}},
  issn         = {{0012-365X}},
  journal      = {{Discrete Mathematics}},
  keywords     = {{Discrete Mathematics and Combinatorics, Theoretical Computer Science}},
  publisher    = {{Elsevier BV}},
  title        = {{{Rotation r-graphs}}},
  doi          = {{10.1016/j.disc.2023.113457}},
  year         = {{2023}},
}

@unpublished{44859,
  author       = {{Ma, Yulai and Mattiolo, Davide and Steffen, Eckhard and Wolf, Isaak Hieronymus}},
  booktitle    = {{arXiv:2305.08619}},
  title        = {{{Sets of r-graphs that color all r-graphs}}},
  year         = {{2023}},
}

@article{46256,
  author       = {{Ma, Yulai and Mattiolo, Davide and Steffen, Eckhard and Wolf, Isaak Hieronymus}},
  issn         = {{0895-4801}},
  journal      = {{SIAM Journal on Discrete Mathematics}},
  keywords     = {{General Mathematics}},
  number       = {{3}},
  pages        = {{1548--1565}},
  publisher    = {{Society for Industrial & Applied Mathematics (SIAM)}},
  title        = {{{Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs}}},
  doi          = {{10.1137/22m1500654}},
  volume       = {{37}},
  year         = {{2023}},
}

@article{31543,
  author       = {{Steffen, Eckhard and Wolf, Isaak Hieronymus}},
  issn         = {{0911-0119}},
  journal      = {{Graphs and Combinatorics}},
  keywords     = {{Discrete Mathematics and Combinatorics, Theoretical Computer Science}},
  number       = {{3}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices}}},
  doi          = {{10.1007/s00373-022-02506-x}},
  volume       = {{38}},
  year         = {{2022}},
}