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