@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}},
}

@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{34042,
  author       = {{Li, Jiaao and Ma, Yulai and Miao, Zhengke and Shi, Yongtang and Wang, Weifan and Zhang, Cun-Quan}},
  issn         = {{0095-8956}},
  journal      = {{Journal of Combinatorial Theory, Series B}},
  keywords     = {{Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Theoretical Computer Science}},
  pages        = {{61--80}},
  publisher    = {{Elsevier BV}},
  title        = {{{Nowhere-zero 3-flows in toroidal graphs}}},
  doi          = {{10.1016/j.jctb.2021.11.001}},
  volume       = {{153}},
  year         = {{2021}},
}

@article{32810,
  author       = {{Li, Jiaao and Ma, Yulai and Shi, Yongtang and Wang, Weifan and Wu, Yezhou}},
  issn         = {{0195-6698}},
  journal      = {{European Journal of Combinatorics}},
  keywords     = {{Discrete Mathematics and Combinatorics}},
  publisher    = {{Elsevier BV}},
  title        = {{{On 3-flow-critical graphs}}},
  doi          = {{10.1016/j.ejc.2021.103451}},
  volume       = {{100}},
  year         = {{2021}},
}