{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T02:11:44Z","timestamp":1778811104120,"version":"3.51.4"},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T00:00:00Z","timestamp":1652918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T00:00:00Z","timestamp":1652918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871329"],"award-info":[{"award-number":["11871329"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s00373-022-02501-2","type":"journal-article","created":{"date-parts":[[2022,5,20]],"date-time":"2022-05-20T11:29:34Z","timestamp":1653046174000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Solution to a Forcible Version of a Graphic Sequence Problem"],"prefix":"10.1007","volume":"38","author":[{"given":"Mao-cheng","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7752-0392","authenticated-orcid":false,"given":"Liying","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,19]]},"reference":[{"key":"2501_CR1","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/s00373-018-1897-5","volume":"34","author":"M Cai","year":"2018","unstructured":"Cai, M., Kang, L.: A characterization of box-bounded degree sequences of graphs. Graphs and Combinatorics 34, 599\u2013606 (2018)","journal-title":"Graphs and Combinatorics"},{"key":"2501_CR2","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0012-365X(00)00022-4","volume":"219","author":"M Cai","year":"2000","unstructured":"Cai, M., Deng, X., Zang, W.: Solution to a problem on degree sequences of graphs. Discrete Math. 219, 253\u2013257 (2000)","journal-title":"Discrete Math."},{"key":"2501_CR3","first-page":"264","volume":"11","author":"P Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., Gallai, T.: Graphs with prescribed degrees of vertices (in Hungarian). Mat. Lapok 11, 264\u2013274 (1960)","journal-title":"Mat. Lapok"},{"key":"2501_CR4","first-page":"287","volume":"16","author":"J Guo","year":"2014","unstructured":"Guo, J., Yin, J.: A variant of Neissen\u2019s problem on degree sequences of graphs. Discrete Math. Theor. Comput. Sci. 16, 287\u2013292 (2014)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"2501_CR5","first-page":"250","volume":"191","author":"T Niessen","year":"1998","unstructured":"Niessen, T.: Problem 297 (Research problems). Discrete Math. 191, 250 (1998)","journal-title":"Discrete Math."},{"key":"2501_CR6","doi-asserted-by":"crossref","unstructured":"Niessen, T.: A characterization of graphs having all $$(g,f)$$-factors, J. Combin. Theory, Ser. B 72 (1998), 152\u2013156","DOI":"10.1006\/jctb.1997.1797"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02501-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02501-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02501-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T22:46:30Z","timestamp":1654814790000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02501-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,19]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["2501"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02501-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,19]]},"assertion":[{"value":"1 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"97"}}