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