article published Davide Mattiolo author Eckhard Steffen author 155480000-0002-9808-7401 2021 eng factorizationperfect matchingsregular graphsr-graphs 0364-9024 1097-0118 1912.0970410.1002/jgt.22729 991107-116 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>. 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>. 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> D. Mattiolo, E. Steffen, Journal of Graph Theory 99 (2021) 107–116. 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>. @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} } 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> 234562021-08-19T12:45:45Z2023-05-16T10:39:20Z