[{"volume":44,"user_id":"15540","_id":"49905","publisher":"Springer Science and Business Media LLC","page":"429-440","status":"public","citation":{"mla":"Ma, Yulai, et al. “Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs.” <i>Combinatorica</i>, vol. 44, Springer Science and Business Media LLC, 2024, pp. 429–40, doi:<a href=\"https://doi.org/10.1007/s00493-023-00078-9\">10.1007/s00493-023-00078-9</a>.","bibtex":"@article{Ma_Mattiolo_Steffen_Wolf_2024, title={Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs}, volume={44}, DOI={<a href=\"https://doi.org/10.1007/s00493-023-00078-9\">10.1007/s00493-023-00078-9</a>}, journal={Combinatorica}, publisher={Springer Science and Business Media LLC}, author={Ma, Yulai and Mattiolo, Davide and Steffen, Eckhard and Wolf, Isaak Hieronymus}, year={2024}, pages={429–440} }","ama":"Ma Y, Mattiolo D, Steffen E, Wolf IH. Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs. <i>Combinatorica</i>. 2024;44:429-440. doi:<a href=\"https://doi.org/10.1007/s00493-023-00078-9\">10.1007/s00493-023-00078-9</a>","ieee":"Y. Ma, D. Mattiolo, E. Steffen, and I. H. Wolf, “Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs,” <i>Combinatorica</i>, vol. 44, pp. 429–440, 2024, doi: <a href=\"https://doi.org/10.1007/s00493-023-00078-9\">10.1007/s00493-023-00078-9</a>.","apa":"Ma, Y., Mattiolo, D., Steffen, E., &#38; Wolf, I. H. (2024). Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs. <i>Combinatorica</i>, <i>44</i>, 429–440. <a href=\"https://doi.org/10.1007/s00493-023-00078-9\">https://doi.org/10.1007/s00493-023-00078-9</a>","short":"Y. Ma, D. Mattiolo, E. Steffen, I.H. Wolf, Combinatorica 44 (2024) 429–440.","chicago":"Ma, Yulai, Davide Mattiolo, Eckhard Steffen, and Isaak Hieronymus Wolf. “Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs.” <i>Combinatorica</i> 44 (2024): 429–40. <a href=\"https://doi.org/10.1007/s00493-023-00078-9\">https://doi.org/10.1007/s00493-023-00078-9</a>."},"doi":"10.1007/s00493-023-00078-9","language":[{"iso":"eng"}],"intvolume":"        44","publication_status":"published","date_updated":"2024-03-22T12:11:35Z","author":[{"id":"92748","full_name":"Ma, Yulai","first_name":"Yulai","last_name":"Ma"},{"last_name":"Mattiolo","first_name":"Davide","full_name":"Mattiolo, Davide"},{"orcid":"0000-0002-9808-7401","first_name":"Eckhard","last_name":"Steffen","full_name":"Steffen, Eckhard","id":"15548"},{"full_name":"Wolf, Isaak Hieronymus","last_name":"Wolf","first_name":"Isaak Hieronymus","id":"88145"}],"publication_identifier":{"issn":["0209-9683","1439-6912"]},"year":"2024","title":"Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs","department":[{"_id":"542"}],"type":"journal_article","keyword":["Computational Mathematics","Discrete Mathematics and Combinatorics"],"date_created":"2023-12-20T10:31:27Z","abstract":[{"text":"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 \u0003 = 5,\r\nand m(t, r) ≤ r − 3 if r is even. We prove that m(2l, r) ≤ 3l − 6 for every l ≥ 3 and r ≥ 2l.","lang":"eng"}],"publication":"Combinatorica"},{"language":[{"iso":"eng"}],"doi":"10.1016/j.dam.2023.05.008","title":"Bounds for the chromatic index of signed multigraphs","year":"2023","author":[{"id":"15548","full_name":"Steffen, Eckhard","orcid":"0000-0002-9808-7401","first_name":"Eckhard","last_name":"Steffen"},{"first_name":"Isaak Hieronymus","last_name":"Wolf","full_name":"Wolf, Isaak Hieronymus","id":"88145"}],"publication_identifier":{"issn":["0166-218X"]},"publication_status":"published","date_updated":"2024-02-14T17:33:59Z","intvolume":"       337","date_created":"2024-02-14T17:33:29Z","type":"journal_article","keyword":["Applied Mathematics","Discrete Mathematics and Combinatorics"],"department":[{"_id":"542"}],"publication":"Discrete Applied Mathematics","page":"185-189","publisher":"Elsevier BV","_id":"51351","user_id":"15540","volume":337,"status":"public","citation":{"ieee":"E. Steffen and I. H. Wolf, “Bounds for the chromatic index of signed multigraphs,” <i>Discrete Applied Mathematics</i>, vol. 337, pp. 185–189, 2023, doi: <a href=\"https://doi.org/10.1016/j.dam.2023.05.008\">10.1016/j.dam.2023.05.008</a>.","apa":"Steffen, E., &#38; Wolf, I. H. (2023). Bounds for the chromatic index of signed multigraphs. <i>Discrete Applied Mathematics</i>, <i>337</i>, 185–189. <a href=\"https://doi.org/10.1016/j.dam.2023.05.008\">https://doi.org/10.1016/j.dam.2023.05.008</a>","chicago":"Steffen, Eckhard, and Isaak Hieronymus Wolf. “Bounds for the Chromatic Index of Signed Multigraphs.” <i>Discrete Applied Mathematics</i> 337 (2023): 185–89. <a href=\"https://doi.org/10.1016/j.dam.2023.05.008\">https://doi.org/10.1016/j.dam.2023.05.008</a>.","short":"E. Steffen, I.H. Wolf, Discrete Applied Mathematics 337 (2023) 185–189.","mla":"Steffen, Eckhard, and Isaak Hieronymus Wolf. “Bounds for the Chromatic Index of Signed Multigraphs.” <i>Discrete Applied Mathematics</i>, vol. 337, Elsevier BV, 2023, pp. 185–89, doi:<a href=\"https://doi.org/10.1016/j.dam.2023.05.008\">10.1016/j.dam.2023.05.008</a>.","bibtex":"@article{Steffen_Wolf_2023, title={Bounds for the chromatic index of signed multigraphs}, volume={337}, DOI={<a href=\"https://doi.org/10.1016/j.dam.2023.05.008\">10.1016/j.dam.2023.05.008</a>}, journal={Discrete Applied Mathematics}, publisher={Elsevier BV}, author={Steffen, Eckhard and Wolf, Isaak Hieronymus}, year={2023}, pages={185–189} }","ama":"Steffen E, Wolf IH. Bounds for the chromatic index of signed multigraphs. <i>Discrete Applied Mathematics</i>. 2023;337:185-189. doi:<a href=\"https://doi.org/10.1016/j.dam.2023.05.008\">10.1016/j.dam.2023.05.008</a>"}},{"year":"2023","title":"Rotation r-graphs","status":"public","publication_identifier":{"issn":["0012-365X"]},"author":[{"id":"15548","first_name":"Eckhard","orcid":"0000-0002-9808-7401","last_name":"Steffen","full_name":"Steffen, Eckhard"},{"full_name":"Wolf, Isaak Hieronymus","first_name":"Isaak Hieronymus","last_name":"Wolf","id":"88145"}],"date_updated":"2024-02-16T08:45:10Z","publication_status":"published","article_number":"113457","language":[{"iso":"eng"}],"_id":"51357","publisher":"Elsevier BV","doi":"10.1016/j.disc.2023.113457","user_id":"15540","publication":"Discrete Mathematics","citation":{"short":"E. Steffen, I.H. Wolf, Discrete Mathematics (2023).","chicago":"Steffen, Eckhard, and Isaak Hieronymus Wolf. “Rotation R-Graphs.” <i>Discrete Mathematics</i>, 2023. <a href=\"https://doi.org/10.1016/j.disc.2023.113457\">https://doi.org/10.1016/j.disc.2023.113457</a>.","apa":"Steffen, E., &#38; Wolf, I. H. (2023). Rotation r-graphs. <i>Discrete Mathematics</i>, Article 113457. <a href=\"https://doi.org/10.1016/j.disc.2023.113457\">https://doi.org/10.1016/j.disc.2023.113457</a>","ieee":"E. Steffen and I. H. Wolf, “Rotation r-graphs,” <i>Discrete Mathematics</i>, Art. no. 113457, 2023, doi: <a href=\"https://doi.org/10.1016/j.disc.2023.113457\">10.1016/j.disc.2023.113457</a>.","ama":"Steffen E, Wolf IH. Rotation r-graphs. <i>Discrete Mathematics</i>. Published online 2023. doi:<a href=\"https://doi.org/10.1016/j.disc.2023.113457\">10.1016/j.disc.2023.113457</a>","bibtex":"@article{Steffen_Wolf_2023, title={Rotation r-graphs}, DOI={<a href=\"https://doi.org/10.1016/j.disc.2023.113457\">10.1016/j.disc.2023.113457</a>}, number={113457}, journal={Discrete Mathematics}, publisher={Elsevier BV}, author={Steffen, Eckhard and Wolf, Isaak Hieronymus}, year={2023} }","mla":"Steffen, Eckhard, and Isaak Hieronymus Wolf. “Rotation R-Graphs.” <i>Discrete Mathematics</i>, 113457, Elsevier BV, 2023, doi:<a href=\"https://doi.org/10.1016/j.disc.2023.113457\">10.1016/j.disc.2023.113457</a>."},"date_created":"2024-02-16T08:44:50Z","type":"journal_article","keyword":["Discrete Mathematics and Combinatorics","Theoretical Computer Science"],"department":[{"_id":"542"}]},{"department":[{"_id":"542"}],"type":"journal_article","keyword":["Discrete Mathematics and Combinatorics"],"date_created":"2022-10-17T07:54:41Z","external_id":{"arxiv":["2106.05928"]},"abstract":[{"text":"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.","lang":"eng"}],"citation":{"apa":"Cappello, C., &#38; Steffen, E. (2022). Symmetric Set Coloring of Signed Graphs. <i>Annals of Combinatorics</i>. <a href=\"https://doi.org/10.1007/s00026-022-00593-4\">https://doi.org/10.1007/s00026-022-00593-4</a>","ieee":"C. Cappello and E. Steffen, “Symmetric Set Coloring of Signed Graphs,” <i>Annals of Combinatorics</i>, 2022, doi: <a href=\"https://doi.org/10.1007/s00026-022-00593-4\">10.1007/s00026-022-00593-4</a>.","chicago":"Cappello, Chiara, and Eckhard Steffen. “Symmetric Set Coloring of Signed Graphs.” <i>Annals of Combinatorics</i>, 2022. <a href=\"https://doi.org/10.1007/s00026-022-00593-4\">https://doi.org/10.1007/s00026-022-00593-4</a>.","short":"C. Cappello, E. Steffen, Annals of Combinatorics (2022).","mla":"Cappello, Chiara, and Eckhard Steffen. “Symmetric Set Coloring of Signed Graphs.” <i>Annals of Combinatorics</i>, Springer Science and Business Media LLC, 2022, doi:<a href=\"https://doi.org/10.1007/s00026-022-00593-4\">10.1007/s00026-022-00593-4</a>.","ama":"Cappello C, Steffen E. Symmetric Set Coloring of Signed Graphs. <i>Annals of Combinatorics</i>. Published online 2022. doi:<a href=\"https://doi.org/10.1007/s00026-022-00593-4\">10.1007/s00026-022-00593-4</a>","bibtex":"@article{Cappello_Steffen_2022, title={Symmetric Set Coloring of Signed Graphs}, DOI={<a href=\"https://doi.org/10.1007/s00026-022-00593-4\">10.1007/s00026-022-00593-4</a>}, journal={Annals of Combinatorics}, publisher={Springer Science and Business Media LLC}, author={Cappello, Chiara and Steffen, Eckhard}, year={2022} }"},"publication":"Annals of Combinatorics","doi":"10.1007/s00026-022-00593-4","user_id":"15540","_id":"33741","publisher":"Springer Science and Business Media LLC","language":[{"iso":"eng"}],"date_updated":"2023-05-16T10:37:58Z","publication_status":"published","publication_identifier":{"issn":["0218-0006","0219-3094"]},"author":[{"id":"72874","full_name":"Cappello, Chiara","last_name":"Cappello","first_name":"Chiara"},{"full_name":"Steffen, Eckhard","last_name":"Steffen","first_name":"Eckhard","orcid":"0000-0002-9808-7401","id":"15548"}],"title":"Symmetric Set Coloring of Signed Graphs","year":"2022","status":"public"},{"status":"public","publisher":"Springer Science and Business Media LLC","_id":"31543","volume":38,"user_id":"15540","citation":{"ama":"Steffen E, Wolf IH. Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices. <i>Graphs and Combinatorics</i>. 2022;38(3). doi:<a href=\"https://doi.org/10.1007/s00373-022-02506-x\">10.1007/s00373-022-02506-x</a>","bibtex":"@article{Steffen_Wolf_2022, title={Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices}, volume={38}, DOI={<a href=\"https://doi.org/10.1007/s00373-022-02506-x\">10.1007/s00373-022-02506-x</a>}, number={3104}, journal={Graphs and Combinatorics}, publisher={Springer Science and Business Media LLC}, author={Steffen, Eckhard and Wolf, Isaak Hieronymus}, year={2022} }","mla":"Steffen, Eckhard, and Isaak Hieronymus Wolf. “Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices.” <i>Graphs and Combinatorics</i>, vol. 38, no. 3, 104, Springer Science and Business Media LLC, 2022, doi:<a href=\"https://doi.org/10.1007/s00373-022-02506-x\">10.1007/s00373-022-02506-x</a>.","short":"E. Steffen, I.H. Wolf, Graphs and Combinatorics 38 (2022).","chicago":"Steffen, Eckhard, and Isaak Hieronymus Wolf. “Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices.” <i>Graphs and Combinatorics</i> 38, no. 3 (2022). <a href=\"https://doi.org/10.1007/s00373-022-02506-x\">https://doi.org/10.1007/s00373-022-02506-x</a>.","apa":"Steffen, E., &#38; Wolf, I. H. (2022). Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices. <i>Graphs and Combinatorics</i>, <i>38</i>(3), Article 104. <a href=\"https://doi.org/10.1007/s00373-022-02506-x\">https://doi.org/10.1007/s00373-022-02506-x</a>","ieee":"E. Steffen and I. H. Wolf, “Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices,” <i>Graphs and Combinatorics</i>, vol. 38, no. 3, Art. no. 104, 2022, doi: <a href=\"https://doi.org/10.1007/s00373-022-02506-x\">10.1007/s00373-022-02506-x</a>."},"external_id":{"arxiv":["2109.11447"]},"author":[{"id":"15548","orcid":"0000-0002-9808-7401","last_name":"Steffen","first_name":"Eckhard","full_name":"Steffen, Eckhard"},{"first_name":"Isaak Hieronymus","last_name":"Wolf","full_name":"Wolf, Isaak Hieronymus","id":"88145"}],"publication_identifier":{"issn":["0911-0119","1435-5914"]},"title":"Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices","year":"2022","intvolume":"        38","date_updated":"2023-05-16T10:41:42Z","publication_status":"published","language":[{"iso":"eng"}],"article_number":"104","doi":"10.1007/s00373-022-02506-x","issue":"3","publication":"Graphs and Combinatorics","date_created":"2022-05-31T06:13:57Z","type":"journal_article","keyword":["Discrete Mathematics and Combinatorics","Theoretical Computer Science"]},{"intvolume":"       322","date_updated":"2023-05-16T10:36:51Z","publication_status":"published","publication_identifier":{"issn":["0166-218X"]},"author":[{"full_name":"Cappello, Chiara","first_name":"Chiara","last_name":"Cappello","id":"72874"},{"last_name":"Steffen","first_name":"Eckhard","orcid":"0000-0002-9808-7401","full_name":"Steffen, Eckhard","id":"15548"}],"title":"Frustration-critical signed graphs","year":"2022","doi":"10.1016/j.dam.2022.08.010","language":[{"iso":"eng"}],"publication":"Discrete Applied Mathematics","department":[{"_id":"542"}],"keyword":["Applied Mathematics","Discrete Mathematics and Combinatorics"],"type":"journal_article","date_created":"2022-10-28T06:51:31Z","status":"public","volume":322,"user_id":"15540","_id":"33950","publisher":"Elsevier BV","page":"183-193","citation":{"ama":"Cappello C, Steffen E. Frustration-critical signed graphs. <i>Discrete Applied Mathematics</i>. 2022;322:183-193. doi:<a href=\"https://doi.org/10.1016/j.dam.2022.08.010\">10.1016/j.dam.2022.08.010</a>","bibtex":"@article{Cappello_Steffen_2022, title={Frustration-critical signed graphs}, volume={322}, DOI={<a href=\"https://doi.org/10.1016/j.dam.2022.08.010\">10.1016/j.dam.2022.08.010</a>}, journal={Discrete Applied Mathematics}, publisher={Elsevier BV}, author={Cappello, Chiara and Steffen, Eckhard}, year={2022}, pages={183–193} }","mla":"Cappello, Chiara, and Eckhard Steffen. “Frustration-Critical Signed Graphs.” <i>Discrete Applied Mathematics</i>, vol. 322, Elsevier BV, 2022, pp. 183–93, doi:<a href=\"https://doi.org/10.1016/j.dam.2022.08.010\">10.1016/j.dam.2022.08.010</a>.","chicago":"Cappello, Chiara, and Eckhard Steffen. “Frustration-Critical Signed Graphs.” <i>Discrete Applied Mathematics</i> 322 (2022): 183–93. <a href=\"https://doi.org/10.1016/j.dam.2022.08.010\">https://doi.org/10.1016/j.dam.2022.08.010</a>.","short":"C. Cappello, E. Steffen, Discrete Applied Mathematics 322 (2022) 183–193.","apa":"Cappello, C., &#38; Steffen, E. (2022). Frustration-critical signed graphs. <i>Discrete Applied Mathematics</i>, <i>322</i>, 183–193. <a href=\"https://doi.org/10.1016/j.dam.2022.08.010\">https://doi.org/10.1016/j.dam.2022.08.010</a>","ieee":"C. Cappello and E. Steffen, “Frustration-critical signed graphs,” <i>Discrete Applied Mathematics</i>, vol. 322, pp. 183–193, 2022, doi: <a href=\"https://doi.org/10.1016/j.dam.2022.08.010\">10.1016/j.dam.2022.08.010</a>."},"external_id":{"arxiv":["2112.02664"]}},{"citation":{"bibtex":"@article{Li_Ma_Miao_Shi_Wang_Zhang_2021, title={Nowhere-zero 3-flows in toroidal graphs}, volume={153}, DOI={<a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">10.1016/j.jctb.2021.11.001</a>}, journal={Journal of Combinatorial Theory, Series B}, publisher={Elsevier BV}, author={Li, Jiaao and Ma, Yulai and Miao, Zhengke and Shi, Yongtang and Wang, Weifan and Zhang, Cun-Quan}, year={2021}, pages={61–80} }","ama":"Li J, Ma Y, Miao Z, Shi Y, Wang W, Zhang C-Q. Nowhere-zero 3-flows in toroidal graphs. <i>Journal of Combinatorial Theory, Series B</i>. 2021;153:61-80. doi:<a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">10.1016/j.jctb.2021.11.001</a>","short":"J. Li, Y. Ma, Z. Miao, Y. Shi, W. Wang, C.-Q. Zhang, Journal of Combinatorial Theory, Series B 153 (2021) 61–80.","chicago":"Li, Jiaao, Yulai Ma, Zhengke Miao, Yongtang Shi, Weifan Wang, and Cun-Quan Zhang. “Nowhere-Zero 3-Flows in Toroidal Graphs.” <i>Journal of Combinatorial Theory, Series B</i> 153 (2021): 61–80. <a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">https://doi.org/10.1016/j.jctb.2021.11.001</a>.","ieee":"J. Li, Y. Ma, Z. Miao, Y. Shi, W. Wang, and C.-Q. Zhang, “Nowhere-zero 3-flows in toroidal graphs,” <i>Journal of Combinatorial Theory, Series B</i>, vol. 153, pp. 61–80, 2021, doi: <a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">10.1016/j.jctb.2021.11.001</a>.","apa":"Li, J., Ma, Y., Miao, Z., Shi, Y., Wang, W., &#38; Zhang, C.-Q. (2021). Nowhere-zero 3-flows in toroidal graphs. <i>Journal of Combinatorial Theory, Series B</i>, <i>153</i>, 61–80. <a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">https://doi.org/10.1016/j.jctb.2021.11.001</a>","mla":"Li, Jiaao, et al. “Nowhere-Zero 3-Flows in Toroidal Graphs.” <i>Journal of Combinatorial Theory, Series B</i>, vol. 153, Elsevier BV, 2021, pp. 61–80, doi:<a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">10.1016/j.jctb.2021.11.001</a>."},"user_id":"15540","volume":153,"page":"61-80","_id":"34042","publisher":"Elsevier BV","status":"public","keyword":["Computational Theory and Mathematics","Discrete Mathematics and Combinatorics","Theoretical Computer Science"],"type":"journal_article","department":[{"_id":"542"}],"date_created":"2022-11-09T08:43:55Z","publication":"Journal of Combinatorial Theory, Series B","doi":"10.1016/j.jctb.2021.11.001","language":[{"iso":"eng"}],"date_updated":"2022-11-09T08:44:37Z","publication_status":"published","intvolume":"       153","year":"2021","title":"Nowhere-zero 3-flows in toroidal graphs","publication_identifier":{"issn":["0095-8956"]},"author":[{"first_name":"Jiaao","last_name":"Li","full_name":"Li, Jiaao"},{"id":"92748","first_name":"Yulai","last_name":"Ma","full_name":"Ma, Yulai"},{"last_name":"Miao","first_name":"Zhengke","full_name":"Miao, Zhengke"},{"full_name":"Shi, Yongtang","last_name":"Shi","first_name":"Yongtang"},{"first_name":"Weifan","last_name":"Wang","full_name":"Wang, Weifan"},{"full_name":"Zhang, Cun-Quan","first_name":"Cun-Quan","last_name":"Zhang"}]},{"status":"public","_id":"32810","publisher":"Elsevier BV","volume":100,"user_id":"15540","citation":{"mla":"Li, Jiaao, et al. “On 3-Flow-Critical Graphs.” <i>European Journal of Combinatorics</i>, vol. 100, 103451, Elsevier BV, 2021, doi:<a href=\"https://doi.org/10.1016/j.ejc.2021.103451\">10.1016/j.ejc.2021.103451</a>.","bibtex":"@article{Li_Ma_Shi_Wang_Wu_2021, title={On 3-flow-critical graphs}, volume={100}, DOI={<a href=\"https://doi.org/10.1016/j.ejc.2021.103451\">10.1016/j.ejc.2021.103451</a>}, number={103451}, journal={European Journal of Combinatorics}, publisher={Elsevier BV}, author={Li, Jiaao and Ma, Yulai and Shi, Yongtang and Wang, Weifan and Wu, Yezhou}, year={2021} }","ama":"Li J, Ma Y, Shi Y, Wang W, Wu Y. On 3-flow-critical graphs. <i>European Journal of Combinatorics</i>. 2021;100. doi:<a href=\"https://doi.org/10.1016/j.ejc.2021.103451\">10.1016/j.ejc.2021.103451</a>","ieee":"J. Li, Y. Ma, Y. Shi, W. Wang, and Y. Wu, “On 3-flow-critical graphs,” <i>European Journal of Combinatorics</i>, vol. 100, Art. no. 103451, 2021, doi: <a href=\"https://doi.org/10.1016/j.ejc.2021.103451\">10.1016/j.ejc.2021.103451</a>.","apa":"Li, J., Ma, Y., Shi, Y., Wang, W., &#38; Wu, Y. (2021). On 3-flow-critical graphs. <i>European Journal of Combinatorics</i>, <i>100</i>, Article 103451. <a href=\"https://doi.org/10.1016/j.ejc.2021.103451\">https://doi.org/10.1016/j.ejc.2021.103451</a>","chicago":"Li, Jiaao, Yulai Ma, Yongtang Shi, Weifan Wang, and Yezhou Wu. “On 3-Flow-Critical Graphs.” <i>European Journal of Combinatorics</i> 100 (2021). <a href=\"https://doi.org/10.1016/j.ejc.2021.103451\">https://doi.org/10.1016/j.ejc.2021.103451</a>.","short":"J. Li, Y. Ma, Y. Shi, W. Wang, Y. Wu, European Journal of Combinatorics 100 (2021)."},"author":[{"full_name":"Li, Jiaao","last_name":"Li","first_name":"Jiaao"},{"id":"92748","last_name":"Ma","first_name":"Yulai","full_name":"Ma, Yulai"},{"full_name":"Shi, Yongtang","first_name":"Yongtang","last_name":"Shi"},{"first_name":"Weifan","last_name":"Wang","full_name":"Wang, Weifan"},{"last_name":"Wu","first_name":"Yezhou","full_name":"Wu, Yezhou"}],"publication_identifier":{"issn":["0195-6698"]},"title":"On 3-flow-critical graphs","year":"2021","intvolume":"       100","date_updated":"2022-08-15T09:35:32Z","publication_status":"published","language":[{"iso":"eng"}],"article_number":"103451","doi":"10.1016/j.ejc.2021.103451","publication":"European Journal of Combinatorics","date_created":"2022-08-15T09:35:02Z","department":[{"_id":"542"}],"type":"journal_article","keyword":["Discrete Mathematics and Combinatorics"]},{"citation":{"mla":"Black, Tobias. “Global Generalized Solutions to a Parabolic-Elliptic Keller-Segel System with Singular Sensitivity.” <i>Discrete &#38;amp; Continuous Dynamical Systems - S</i>, vol. 13, no. 2, American Institute of Mathematical Sciences (AIMS), 2019, pp. 119–37, doi:<a href=\"https://doi.org/10.3934/dcdss.2020007\">10.3934/dcdss.2020007</a>.","bibtex":"@article{Black_2019, title={Global generalized solutions to a parabolic-elliptic Keller-Segel system with singular sensitivity}, volume={13}, DOI={<a href=\"https://doi.org/10.3934/dcdss.2020007\">10.3934/dcdss.2020007</a>}, number={2}, journal={Discrete &#38;amp; Continuous Dynamical Systems - S}, publisher={American Institute of Mathematical Sciences (AIMS)}, author={Black, Tobias}, year={2019}, pages={119–137} }","ama":"Black T. Global generalized solutions to a parabolic-elliptic Keller-Segel system with singular sensitivity. <i>Discrete &#38;amp; Continuous Dynamical Systems - S</i>. 2019;13(2):119-137. doi:<a href=\"https://doi.org/10.3934/dcdss.2020007\">10.3934/dcdss.2020007</a>","ieee":"T. Black, “Global generalized solutions to a parabolic-elliptic Keller-Segel system with singular sensitivity,” <i>Discrete &#38;amp; Continuous Dynamical Systems - S</i>, vol. 13, no. 2, pp. 119–137, 2019, doi: <a href=\"https://doi.org/10.3934/dcdss.2020007\">10.3934/dcdss.2020007</a>.","apa":"Black, T. (2019). Global generalized solutions to a parabolic-elliptic Keller-Segel system with singular sensitivity. <i>Discrete &#38;amp; Continuous Dynamical Systems - S</i>, <i>13</i>(2), 119–137. <a href=\"https://doi.org/10.3934/dcdss.2020007\">https://doi.org/10.3934/dcdss.2020007</a>","short":"T. Black, Discrete &#38;amp; Continuous Dynamical Systems - S 13 (2019) 119–137.","chicago":"Black, Tobias. “Global Generalized Solutions to a Parabolic-Elliptic Keller-Segel System with Singular Sensitivity.” <i>Discrete &#38;amp; Continuous Dynamical Systems - S</i> 13, no. 2 (2019): 119–37. <a href=\"https://doi.org/10.3934/dcdss.2020007\">https://doi.org/10.3934/dcdss.2020007</a>."},"status":"public","page":"119-137","publisher":"American Institute of Mathematical Sciences (AIMS)","_id":"34672","user_id":"23686","volume":13,"publication":"Discrete &amp; Continuous Dynamical Systems - S","issue":"2","date_created":"2022-12-21T09:48:28Z","keyword":["Applied Mathematics","Discrete Mathematics and Combinatorics","Analysis"],"type":"journal_article","department":[{"_id":"34"},{"_id":"10"},{"_id":"90"}],"year":"2019","title":"Global generalized solutions to a parabolic-elliptic Keller-Segel system with singular sensitivity","author":[{"id":"23686","full_name":"Black, Tobias","first_name":"Tobias","last_name":"Black","orcid":"0000-0001-9963-0800"}],"publication_identifier":{"issn":["1937-1179"]},"date_updated":"2022-12-21T10:04:44Z","publication_status":"published","intvolume":"        13","language":[{"iso":"eng"}],"doi":"10.3934/dcdss.2020007"},{"doi":"10.3934/dcdsb.2017061","language":[{"iso":"eng"}],"intvolume":"        22","publication_status":"published","date_updated":"2022-12-21T10:05:19Z","author":[{"full_name":"Black, Tobias","last_name":"Black","orcid":"0000-0001-9963-0800","first_name":"Tobias","id":"23686"}],"publication_identifier":{"issn":["1553-524X"]},"year":"2017","title":"Global existence and asymptotic stability in a competitive two-species chemotaxis system with two signals","department":[{"_id":"34"},{"_id":"10"},{"_id":"90"}],"keyword":["Applied Mathematics","Discrete Mathematics and Combinatorics"],"type":"journal_article","date_created":"2022-12-21T09:46:50Z","publication":"Discrete &amp; Continuous Dynamical Systems - B","issue":"4","volume":22,"user_id":"23686","_id":"34663","publisher":"American Institute of Mathematical Sciences (AIMS)","page":"1253-1272","status":"public","citation":{"mla":"Black, Tobias. “Global Existence and Asymptotic Stability in a Competitive Two-Species Chemotaxis System with Two Signals.” <i>Discrete &#38;amp; Continuous Dynamical Systems - B</i>, vol. 22, no. 4, American Institute of Mathematical Sciences (AIMS), 2017, pp. 1253–72, doi:<a href=\"https://doi.org/10.3934/dcdsb.2017061\">10.3934/dcdsb.2017061</a>.","bibtex":"@article{Black_2017, title={Global existence and asymptotic stability in a competitive two-species chemotaxis system with two signals}, volume={22}, DOI={<a href=\"https://doi.org/10.3934/dcdsb.2017061\">10.3934/dcdsb.2017061</a>}, number={4}, journal={Discrete &#38;amp; Continuous Dynamical Systems - B}, publisher={American Institute of Mathematical Sciences (AIMS)}, author={Black, Tobias}, year={2017}, pages={1253–1272} }","ama":"Black T. Global existence and asymptotic stability in a competitive two-species chemotaxis system with two signals. <i>Discrete &#38;amp; Continuous Dynamical Systems - B</i>. 2017;22(4):1253-1272. doi:<a href=\"https://doi.org/10.3934/dcdsb.2017061\">10.3934/dcdsb.2017061</a>","ieee":"T. Black, “Global existence and asymptotic stability in a competitive two-species chemotaxis system with two signals,” <i>Discrete &#38;amp; Continuous Dynamical Systems - B</i>, vol. 22, no. 4, pp. 1253–1272, 2017, doi: <a href=\"https://doi.org/10.3934/dcdsb.2017061\">10.3934/dcdsb.2017061</a>.","apa":"Black, T. (2017). Global existence and asymptotic stability in a competitive two-species chemotaxis system with two signals. <i>Discrete &#38;amp; Continuous Dynamical Systems - B</i>, <i>22</i>(4), 1253–1272. <a href=\"https://doi.org/10.3934/dcdsb.2017061\">https://doi.org/10.3934/dcdsb.2017061</a>","short":"T. Black, Discrete &#38;amp; Continuous Dynamical Systems - B 22 (2017) 1253–1272.","chicago":"Black, Tobias. “Global Existence and Asymptotic Stability in a Competitive Two-Species Chemotaxis System with Two Signals.” <i>Discrete &#38;amp; Continuous Dynamical Systems - B</i> 22, no. 4 (2017): 1253–72. <a href=\"https://doi.org/10.3934/dcdsb.2017061\">https://doi.org/10.3934/dcdsb.2017061</a>."}}]