{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T09:11:37Z","timestamp":1723021897468},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,9,18]],"date-time":"2008-09-18T00:00:00Z","timestamp":1221696000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1007\/s00186-008-0265-2","type":"journal-article","created":{"date-parts":[[2008,9,17]],"date-time":"2008-09-17T12:21:53Z","timestamp":1221654113000},"page":"369-374","source":"Crossref","is-referenced-by-count":3,"title":["A remark on degree sequences of multigraphs"],"prefix":"10.1007","volume":"69","author":[{"given":"Dirk","family":"Meierling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lutz","family":"Volkmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,9,18]]},"reference":[{"key":"265_CR1","doi-asserted-by":"crossref","unstructured":"Boesch F, Harary F (1976) Line removal algorithms for graphs and their degree lists. IEEE Trans Circuits Syst CAS-23(12):778\u2013782. Special issue on large-scale networks and systems","DOI":"10.1109\/TCS.1976.1084170"},{"key":"265_CR2","first-page":"161","volume":"77","author":"P Dankelmann","year":"2005","unstructured":"Dankelmann P, Oellermann O (2005) Degree sequences of optimally edge-connected multigraphs. Ars Comb 77: 161\u2013168","journal-title":"Ars Comb"},{"key":"265_CR3","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1137\/0110037","volume":"10","author":"SL Hakimi","year":"1962","unstructured":"Hakimi SL (1962) On realizability of a set of integers as degrees of the vertices of a linear graph I. J Soc Indust Appl Math 10: 496\u2013506","journal-title":"J Soc Indust Appl Math"},{"key":"265_CR4","doi-asserted-by":"crossref","first-page":"477","DOI":"10.21136\/CPM.1955.108220","volume":"80","author":"V Havel","year":"1955","unstructured":"Havel V (1955) Eine Bemerkung \u00fcber die Existenz der endlichen Graphen (Czech). \u010casopis P\u011bst Mat 80: 477\u2013480","journal-title":"\u010casopis P\u011bst Mat"},{"issue":"3","key":"265_CR5","first-page":"546","volume":"E77-A","author":"M Takahashi","year":"1994","unstructured":"Takahashi M, Imai K, Asano T (1994) Graphical degree sequence problems. IEICE Trans Fundam E77-A(3): 546\u2013552","journal-title":"IEICE Trans Fundam"},{"issue":"12\u201319","key":"265_CR6","first-page":"133","volume":"6","author":"RI Tyshkevich","year":"1987","unstructured":"Tyshkevich RI, Chernyak AA, Chernyak Zh A (1987) Graphs and degree sequences I. Kibernetika (Kiev) 6(12\u201319): 133","journal-title":"Kibernetika (Kiev)"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-008-0265-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-008-0265-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-008-0265-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,16]],"date-time":"2021-09-16T17:02:43Z","timestamp":1631811763000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-008-0265-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,18]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["265"],"URL":"https:\/\/doi.org\/10.1007\/s00186-008-0265-2","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,9,18]]}}}