Highly edge‐connected regular graphs without large factorizable subgraphs Mattiolo, Davide Steffen, Eckhard factorization perfect matchings regular graphs r-graphs 2021 info:eu-repo/semantics/article doc-type:article text http://purl.org/coar/resource_type/c_6501 https://ris.uni-paderborn.de/record/23456 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> eng info:eu-repo/semantics/altIdentifier/doi/10.1002/jgt.22729 info:eu-repo/semantics/altIdentifier/issn/0364-9024 info:eu-repo/semantics/altIdentifier/issn/1097-0118 info:eu-repo/semantics/altIdentifier/arxiv/1912.09704 info:eu-repo/semantics/closedAccess