{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:27:45Z","timestamp":1759847265045},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"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":6803,"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":[[1994,12]]},"DOI":"10.1016\/0012-365x(93)e0077-h","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"169-176","source":"Crossref","is-referenced-by-count":10,"title":["Longest cycles in threshold graphs"],"prefix":"10.1016","volume":"135","author":[{"given":"N.V.R.","family":"Mahadev","sequence":"first","affiliation":[]},{"given":"U.N.","family":"Peled","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)E0077-H_BIB1","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF01788543","article-title":"Enumeration of labelled threshold graphs and a theorem of Frobenius involving eulerian polynomials","volume":"3","author":"Beissinger","year":"1987","journal-title":"Graphs Combin."},{"key":"10.1016\/0012-365X(93)E0077-H_BIB2","author":"Bondy","year":"1976"},{"key":"10.1016\/0012-365X(93)E0077-H_BIB3","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0095-8956(72)90020-2","article-title":"On Hamilton's ideals","volume":"12","author":"Chv\u00e1tal","year":"1972","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(93)E0077-H_BIB4","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0167-5060(08)70731-3","article-title":"Aggregation of inequalities in integer programming","volume":"1","author":"Chv\u00e1tal","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0012-365X(93)E0077-H_BIB5","article-title":"On a graph labelling problem","author":"Ecker","year":"1977","journal-title":"Gesellschraft f\u00fcr Mathematik und Datenverarbeitung mbH Bonn"},{"key":"10.1016\/0012-365X(93)E0077-H_BIB6","author":"Garey","year":"1979"},{"key":"10.1016\/0012-365X(93)E0077-H_BIB7","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0012-365X(78)90178-4","article-title":"Trivially perfect graphs","volume":"24","author":"Golumbic","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)E0077-H_BIB8","author":"Golumbic","year":"1980"},{"key":"10.1016\/0012-365X(93)E0077-H_BIB9","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1137\/0602006","article-title":"Threshold sequences","volume":"2","author":"Hammer","year":"1981","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0012-365X(93)E0077-H_BIB10","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(87)90050-3","article-title":"Hamiltonian threshold graphs","volume":"16","author":"Harary","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(93)E0077-H_BIB11","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1137\/0206008","article-title":"A graph-theoretic characterization of the PV chunk class of synchronizing primitives","volume":"6","author":"Henderson","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(93)E0077-H_BIB12","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0095-8956(73)90037-3","article-title":"Extreme degree sequences of simple graphs","volume":"15","author":"Koren","year":"1983","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(93)E0077-H_BIB13","author":"Muroga","year":"1979"},{"key":"10.1016\/0012-365X(93)E0077-H_BIB14","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/S0167-5060(08)70749-0","article-title":"The minimal integral separator of a threshold graph","volume":"1","author":"Orlin","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0012-365X(93)E0077-H_BIB15","first-page":"735","article-title":"Threshold graph enumeration and series-product identities","volume":"29","author":"Peled","year":"1980","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(93)E0077-H_BIB16","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/0024-3795(89)90470-9","article-title":"The polytope of degree sequences","volume":"114\/115","author":"Peled","year":"1989","journal-title":"Linear Algebra Appl."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X93E0077H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X93E0077H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:22:55Z","timestamp":1555136575000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X93E0077H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["0012365X93E0077H"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)e0077-h","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}