{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T23:38:20Z","timestamp":1772753900205,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7899,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1991,12]]},"DOI":"10.1016\/0012-365x(91)90311-o","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:46:59Z","timestamp":1027655219000},"page":"175-181","source":"Crossref","is-referenced-by-count":7,"title":["On forcibly connected graphic sequences"],"prefix":"10.1016","volume":"96","author":[{"given":"S.A.","family":"Choudum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(91)90311-O_BIB1","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0012-365X(91)90311-O_BIB2","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/0095-8956(74)90058-6","article-title":"The strongest monotone degree condition for n-connectedness of a graph","volume":"16","author":"Boesh","year":"1974","journal-title":"J. Combin. Theory Ser. B."},{"key":"10.1016\/0012-365X(91)90311-O_BIB3","first-page":"473","article-title":"Properties of graphs with constraints on degrees","volume":"4","author":"Bondy","year":"1969","journal-title":"Studia Sci. Math. Hungar."},{"key":"10.1016\/0012-365X(91)90311-O_BIB4","first-page":"385","article-title":"Graphic sequences and graphic polynomials, a report","volume":"10","author":"Eggleton","year":"1973","journal-title":"Infinite and Finite Sets, Colloq. Math. Soc. J\u00e1nos Bolyai"},{"key":"10.1016\/0012-365X(91)90311-O_BIB5","unstructured":"C.St.J.A. Nash-Williams, Valency sequences which force graphs to have hamiltonian circuits: Interim report, University of Waterloo, Waterloo, Canada."},{"key":"10.1016\/0012-365X(91)90311-O_BIB6","first-page":"417","article-title":"A survey of the theory of potentially p-graphic and forcibly p-graphic sequences","volume":"Vol. 885","author":"Rao","year":"1981"},{"key":"10.1016\/0012-365X(91)90311-O_BIB7","first-page":"255","article-title":"Extension of graphical sequences","volume":"12","author":"Reid","year":"1977","journal-title":"Utilitas Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9190311O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9190311O?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:26:15Z","timestamp":1555129575000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9190311O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["0012365X9190311O"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(91)90311-o","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}