{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T08:02:54Z","timestamp":1747468974960},"reference-count":6,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":10359,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1978,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Simple necessary and sufficient conditions for a list of integers to be the degrees of the points of a tree are wellknown. Unicyclic graphs, which are connected graphs with exactly one cycle, are considered here. A simple set of necessary and sufficient conditions for a list of integers to be the degrees of the points of such a graph is derived.<\/jats:p>","DOI":"10.1002\/net.3230080202","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T08:19:39Z","timestamp":1178871579000},"page":"93-96","source":"Crossref","is-referenced-by-count":6,"title":["Unicyclic realizability of a degree list"],"prefix":"10.1002","volume":"8","author":[{"given":"F. T.","family":"Boesch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Harary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"Beineke L. W.andE. F.Schmeichel \u201cOn Degrees and Cycles in Graphs \u201d to appear."},{"key":"e_1_2_1_3_2","first-page":"264","article-title":"Graphs with Prescribed Degrees of Vertices,\u201d (Hungarian)","volume":"11","author":"Erd\u00f6s P.","year":"1960","journal-title":"Mat. Lapok"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1137\/0110037"},{"key":"e_1_2_1_5_3","first-page":"143","volume":"11","year":"1963","journal-title":"J. Siam"},{"key":"e_1_2_1_6_2","doi-asserted-by":"crossref","first-page":"477","DOI":"10.21136\/CPM.1955.108220","article-title":"A Remark on the Existence of Finite Graphs,\u201d (Czech)","volume":"80","author":"Havel V.","year":"1955","journal-title":"C\u01cesopis P\u011bst. Mat."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230080202","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230080202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T08:35:30Z","timestamp":1699778130000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230080202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,6]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1978,6]]}},"alternative-id":["10.1002\/net.3230080202"],"URL":"https:\/\/doi.org\/10.1002\/net.3230080202","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978,6]]}}}