{"date_updated":"2023-05-16T10:53:21Z","author":[{"first_name":"Ligang","last_name":"Jin","full_name":"Jin, Ligang"},{"last_name":"Steffen","full_name":"Steffen, Eckhard","id":"15548","first_name":"Eckhard","orcid":"0000-0002-9808-7401"}],"status":"public","language":[{"iso":"eng"}],"intvolume":"        11","_id":"12971","year":"2020","page":"457-473","type":"journal_article","publication":"J. of Combinatorics","title":"Unions of 1-factors in r-graphs and overfull graphs","external_id":{"arxiv":["1509.01823"]},"date_created":"2019-08-26T13:53:51Z","citation":{"short":"L. Jin, E. Steffen, J. of Combinatorics 11 (2020) 457–473.","bibtex":"@article{Jin_Steffen_2020, title={Unions of 1-factors in r-graphs and overfull graphs}, volume={11}, journal={J. of Combinatorics}, author={Jin, Ligang and Steffen, Eckhard}, year={2020}, pages={457–473} }","chicago":"Jin, Ligang, and Eckhard Steffen. “Unions of 1-Factors in r-Graphs and Overfull Graphs.” <i>J. of Combinatorics</i> 11 (2020): 457–73.","ama":"Jin L, Steffen E. Unions of 1-factors in r-graphs and overfull graphs. <i>J of Combinatorics</i>. 2020;11:457-473.","mla":"Jin, Ligang, and Eckhard Steffen. “Unions of 1-Factors in r-Graphs and Overfull Graphs.” <i>J. of Combinatorics</i>, vol. 11, 2020, pp. 457–73.","ieee":"L. Jin and E. Steffen, “Unions of 1-factors in r-graphs and overfull graphs,” <i>J. of Combinatorics</i>, vol. 11, pp. 457–473, 2020.","apa":"Jin, L., &#38; Steffen, E. (2020). Unions of 1-factors in r-graphs and overfull graphs. <i>J. of Combinatorics</i>, <i>11</i>, 457–473."},"user_id":"15540","volume":11}