[{"keyword":["Discrete Mathematics and Combinatorics","Theoretical Computer Science"],"language":[{"iso":"eng"}],"external_id":{"arxiv":["2109.11447"]},"publication":"Graphs and Combinatorics","title":"Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices","publisher":"Springer Science and Business Media LLC","date_created":"2022-05-31T06:13:57Z","year":"2022","issue":"3","article_number":"104","_id":"31543","user_id":"15540","status":"public","type":"journal_article","doi":"10.1007/s00373-022-02506-x","date_updated":"2023-05-16T10:41:42Z","author":[{"orcid":"0000-0002-9808-7401","last_name":"Steffen","id":"15548","full_name":"Steffen, Eckhard","first_name":"Eckhard"},{"full_name":"Wolf, Isaak Hieronymus","id":"88145","last_name":"Wolf","first_name":"Isaak Hieronymus"}],"volume":38,"citation":{"short":"E. Steffen, I.H. Wolf, Graphs and Combinatorics 38 (2022).","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>.","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>","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>.","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>.","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>"},"intvolume":"        38","publication_status":"published","publication_identifier":{"issn":["0911-0119","1435-5914"]}},{"language":[{"iso":"eng"}],"_id":"21827","external_id":{"arxiv":["1903.12385"]},"user_id":"15540","status":"public","publication":"Graphs and Combinatorics","type":"journal_article","title":"Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs","doi":"10.1007/s00373-020-02266-6","date_updated":"2023-05-16T10:45:10Z","author":[{"first_name":"Antje","last_name":"Klopp","full_name":"Klopp, Antje"},{"last_name":"Steffen","orcid":"0000-0002-9808-7401","id":"15548","full_name":"Steffen, Eckhard","first_name":"Eckhard"}],"date_created":"2021-04-30T07:22:24Z","year":"2021","page":"559-580","citation":{"ieee":"A. Klopp and E. Steffen, “Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs,” <i>Graphs and Combinatorics</i>, pp. 559–580, 2021, doi: <a href=\"https://doi.org/10.1007/s00373-020-02266-6\">10.1007/s00373-020-02266-6</a>.","chicago":"Klopp, Antje, and Eckhard Steffen. “Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs.” <i>Graphs and Combinatorics</i>, 2021, 559–80. <a href=\"https://doi.org/10.1007/s00373-020-02266-6\">https://doi.org/10.1007/s00373-020-02266-6</a>.","ama":"Klopp A, Steffen E. Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs. <i>Graphs and Combinatorics</i>. Published online 2021:559-580. doi:<a href=\"https://doi.org/10.1007/s00373-020-02266-6\">10.1007/s00373-020-02266-6</a>","short":"A. Klopp, E. Steffen, Graphs and Combinatorics (2021) 559–580.","bibtex":"@article{Klopp_Steffen_2021, title={Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs}, DOI={<a href=\"https://doi.org/10.1007/s00373-020-02266-6\">10.1007/s00373-020-02266-6</a>}, journal={Graphs and Combinatorics}, author={Klopp, Antje and Steffen, Eckhard}, year={2021}, pages={559–580} }","mla":"Klopp, Antje, and Eckhard Steffen. “Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs.” <i>Graphs and Combinatorics</i>, 2021, pp. 559–80, doi:<a href=\"https://doi.org/10.1007/s00373-020-02266-6\">10.1007/s00373-020-02266-6</a>.","apa":"Klopp, A., &#38; Steffen, E. (2021). Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs. <i>Graphs and Combinatorics</i>, 559–580. <a href=\"https://doi.org/10.1007/s00373-020-02266-6\">https://doi.org/10.1007/s00373-020-02266-6</a>"},"publication_identifier":{"issn":["0911-0119","1435-5914"]},"publication_status":"published"}]