[{"type":"journal_article","status":"public","_id":"23456","user_id":"15540","article_type":"original","publication_status":"published","publication_identifier":{"issn":["0364-9024","1097-0118"]},"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>.","short":"D. Mattiolo, E. Steffen, Journal of Graph Theory 99 (2021) 107–116.","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} }","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>","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>.","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>.","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>"},"page":"107-116","intvolume":"        99","date_updated":"2023-05-16T10:39:20Z","author":[{"full_name":"Mattiolo, Davide","last_name":"Mattiolo","first_name":"Davide"},{"id":"15548","full_name":"Steffen, Eckhard","last_name":"Steffen","orcid":"0000-0002-9808-7401","first_name":"Eckhard"}],"volume":99,"doi":"10.1002/jgt.22729","publication":"Journal of Graph Theory","external_id":{"arxiv":["1912.09704"]},"keyword":["factorization","perfect matchings","regular graphs","r-graphs"],"language":[{"iso":"eng"}],"issue":"1","year":"2021","date_created":"2021-08-19T12:45:45Z","title":"Highly edge‐connected regular graphs without large factorizable subgraphs"}]