[{"external_id":{"arxiv":["2001.02484"]},"date_created":"2021-10-18T12:58:47Z","type":"journal_article","publication":"Journal of Graph Theory","issue":"3","citation":{"ama":"Mattiolo D, Steffen E. Edge colorings and circular flows on regular graphs. <i>Journal of Graph Theory</i>. 2022;99(3):399-413. doi:<a href=\"https://doi.org/10.1002/jgt.22746\">10.1002/jgt.22746</a>","bibtex":"@article{Mattiolo_Steffen_2022, title={Edge colorings and circular flows on regular graphs}, volume={99}, DOI={<a href=\"https://doi.org/10.1002/jgt.22746\">10.1002/jgt.22746</a>}, number={3}, journal={Journal of Graph Theory}, author={Mattiolo, Davide and Steffen, Eckhard}, year={2022}, pages={399–413} }","mla":"Mattiolo, Davide, and Eckhard Steffen. “Edge Colorings and Circular Flows on Regular Graphs.” <i>Journal of Graph Theory</i>, vol. 99, no. 3, 2022, pp. 399–413, doi:<a href=\"https://doi.org/10.1002/jgt.22746\">10.1002/jgt.22746</a>.","chicago":"Mattiolo, Davide, and Eckhard Steffen. “Edge Colorings and Circular Flows on Regular Graphs.” <i>Journal of Graph Theory</i> 99, no. 3 (2022): 399–413. <a href=\"https://doi.org/10.1002/jgt.22746\">https://doi.org/10.1002/jgt.22746</a>.","short":"D. Mattiolo, E. Steffen, Journal of Graph Theory 99 (2022) 399–413.","apa":"Mattiolo, D., &#38; Steffen, E. (2022). Edge colorings and circular flows on regular graphs. <i>Journal of Graph Theory</i>, <i>99</i>(3), 399–413. <a href=\"https://doi.org/10.1002/jgt.22746\">https://doi.org/10.1002/jgt.22746</a>","ieee":"D. Mattiolo and E. Steffen, “Edge colorings and circular flows on regular graphs,” <i>Journal of Graph Theory</i>, vol. 99, no. 3, pp. 399–413, 2022, doi: <a href=\"https://doi.org/10.1002/jgt.22746\">10.1002/jgt.22746</a>."},"page":"399-413","_id":"26408","language":[{"iso":"eng"}],"doi":"10.1002/jgt.22746","user_id":"15540","volume":99,"year":"2022","title":"Edge colorings and circular flows on regular graphs","status":"public","author":[{"last_name":"Mattiolo","first_name":"Davide","full_name":"Mattiolo, Davide"},{"id":"15548","last_name":"Steffen","first_name":"Eckhard","orcid":"0000-0002-9808-7401","full_name":"Steffen, Eckhard"}],"publication_identifier":{"issn":["0364-9024","1097-0118"]},"date_updated":"2023-05-16T10:42:45Z","publication_status":"published","intvolume":"        99"},{"external_id":{"arxiv":["1912.09704"]},"citation":{"mla":"Mattiolo, Davide, and Eckhard Steffen. “Highly Edge‐connected Regular Graphs without Large Factorizable Subgraphs.” <i>Journal of Graph Theory</i>, vol. 99, no. 1, 2021, pp. 107–16, doi:<a href=\"https://doi.org/10.1002/jgt.22729\">10.1002/jgt.22729</a>.","bibtex":"@article{Mattiolo_Steffen_2021, title={Highly edge‐connected regular graphs without large factorizable subgraphs}, volume={99}, DOI={<a href=\"https://doi.org/10.1002/jgt.22729\">10.1002/jgt.22729</a>}, number={1}, journal={Journal of Graph Theory}, author={Mattiolo, Davide and Steffen, Eckhard}, year={2021}, pages={107–116} }","ama":"Mattiolo D, Steffen E. Highly edge‐connected regular graphs without large factorizable subgraphs. <i>Journal of Graph Theory</i>. 2021;99(1):107-116. doi:<a href=\"https://doi.org/10.1002/jgt.22729\">10.1002/jgt.22729</a>","ieee":"D. Mattiolo and E. Steffen, “Highly edge‐connected regular graphs without large factorizable subgraphs,” <i>Journal of Graph Theory</i>, vol. 99, no. 1, pp. 107–116, 2021, doi: <a href=\"https://doi.org/10.1002/jgt.22729\">10.1002/jgt.22729</a>.","apa":"Mattiolo, D., &#38; Steffen, E. (2021). Highly edge‐connected regular graphs without large factorizable subgraphs. <i>Journal of Graph Theory</i>, <i>99</i>(1), 107–116. <a href=\"https://doi.org/10.1002/jgt.22729\">https://doi.org/10.1002/jgt.22729</a>","short":"D. Mattiolo, E. Steffen, Journal of Graph Theory 99 (2021) 107–116.","chicago":"Mattiolo, Davide, and Eckhard Steffen. “Highly Edge‐connected Regular Graphs without Large Factorizable Subgraphs.” <i>Journal of Graph Theory</i> 99, no. 1 (2021): 107–16. <a href=\"https://doi.org/10.1002/jgt.22729\">https://doi.org/10.1002/jgt.22729</a>."},"page":"107-116","_id":"23456","user_id":"15540","volume":99,"status":"public","date_created":"2021-08-19T12:45:45Z","keyword":["factorization","perfect matchings","regular graphs","r-graphs"],"type":"journal_article","issue":"1","publication":"Journal of Graph Theory","language":[{"iso":"eng"}],"doi":"10.1002/jgt.22729","year":"2021","title":"Highly edge‐connected regular graphs without large factorizable subgraphs","author":[{"full_name":"Mattiolo, Davide","last_name":"Mattiolo","first_name":"Davide"},{"first_name":"Eckhard","orcid":"0000-0002-9808-7401","last_name":"Steffen","full_name":"Steffen, Eckhard","id":"15548"}],"publication_identifier":{"issn":["0364-9024","1097-0118"]},"date_updated":"2023-05-16T10:39:20Z","publication_status":"published","intvolume":"        99","article_type":"original"}]