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

@article{33741,
  abstract     = {{There are many concepts of signed graph coloring which are defined by assigning colors to the vertices of the graphs. These concepts usually differ in the number of self-inverse colors used. We introduce a unifying concept for this kind of coloring by assigning elements from symmetric sets to the vertices of the signed graphs. In the first part of the paper, we study colorings with elements from symmetric sets where the number of self-inverse elements is fixed. We prove a Brooks’-type theorem and upper bounds for the corresponding chromatic numbers in terms of the chromatic number of the underlying graph. These results are used in the second part where we introduce the symset-chromatic number χsym(G,σ) of a signed graph (G,σ). We show that the symset-chromatic number gives the minimum partition of a signed graph into independent sets and non-bipartite antibalanced subgraphs. In particular, χsym(G,σ)≤χ(G). In the final section we show that these colorings can also be formalized as DP-colorings.}},
  author       = {{Cappello, Chiara and Steffen, Eckhard}},
  issn         = {{0218-0006}},
  journal      = {{Annals of Combinatorics}},
  keywords     = {{Discrete Mathematics and Combinatorics}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Symmetric Set Coloring of Signed Graphs}}},
  doi          = {{10.1007/s00026-022-00593-4}},
  year         = {{2022}},
}

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

@article{33950,
  author       = {{Cappello, Chiara and Steffen, Eckhard}},
  issn         = {{0166-218X}},
  journal      = {{Discrete Applied Mathematics}},
  keywords     = {{Applied Mathematics, Discrete Mathematics and Combinatorics}},
  pages        = {{183--193}},
  publisher    = {{Elsevier BV}},
  title        = {{{Frustration-critical signed graphs}}},
  doi          = {{10.1016/j.dam.2022.08.010}},
  volume       = {{322}},
  year         = {{2022}},
}

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

@article{34672,
  author       = {{Black, Tobias}},
  issn         = {{1937-1179}},
  journal      = {{Discrete & Continuous Dynamical Systems - S}},
  keywords     = {{Applied Mathematics, Discrete Mathematics and Combinatorics, Analysis}},
  number       = {{2}},
  pages        = {{119--137}},
  publisher    = {{American Institute of Mathematical Sciences (AIMS)}},
  title        = {{{Global generalized solutions to a parabolic-elliptic Keller-Segel system with singular sensitivity}}},
  doi          = {{10.3934/dcdss.2020007}},
  volume       = {{13}},
  year         = {{2019}},
}

@article{34663,
  author       = {{Black, Tobias}},
  issn         = {{1553-524X}},
  journal      = {{Discrete & Continuous Dynamical Systems - B}},
  keywords     = {{Applied Mathematics, Discrete Mathematics and Combinatorics}},
  number       = {{4}},
  pages        = {{1253--1272}},
  publisher    = {{American Institute of Mathematical Sciences (AIMS)}},
  title        = {{{Global existence and asymptotic stability in a competitive two-species chemotaxis system with two signals}}},
  doi          = {{10.3934/dcdsb.2017061}},
  volume       = {{22}},
  year         = {{2017}},
}