{"date_created":"2019-08-26T13:53:51Z","date_updated":"2023-05-16T10:53:21Z","author":[{"full_name":"Jin, Ligang","first_name":"Ligang","last_name":"Jin"},{"first_name":"Eckhard","full_name":"Steffen, Eckhard","orcid":"0000-0002-9808-7401","last_name":"Steffen","id":"15548"}],"_id":"12971","type":"journal_article","year":"2020","title":"Unions of 1-factors in r-graphs and overfull graphs","volume":11,"external_id":{"arxiv":["1509.01823"]},"status":"public","user_id":"15540","page":"457-473","citation":{"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.","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.","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.","ama":"Jin L, Steffen E. Unions of 1-factors in r-graphs and overfull graphs. <i>J of Combinatorics</i>. 2020;11:457-473.","short":"L. Jin, E. Steffen, J. of Combinatorics 11 (2020) 457–473.","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."},"intvolume":"        11","publication":"J. of Combinatorics","language":[{"iso":"eng"}]}