{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T17:38:29Z","timestamp":1648834709202},"reference-count":5,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"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":6010,"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":[[1997,2]]},"DOI":"10.1016\/s0012-365x(96)00066-0","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"313-316","source":"Crossref","is-referenced-by-count":1,"title":["An upper bound for the Hamiltonicity exponent of finite digraphs"],"prefix":"10.1016","volume":"164","author":[{"given":"G\u00fcnter","family":"Schaar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Pawel Wojda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00066-0_BIB1","article-title":"Cycles dans les graphes et G-configurations","author":"Bermond","year":"1975"},{"key":"10.1016\/S0012-365X(96)00066-0_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.3190050102","article-title":"Cycles in digraphs \u2014 a survey","volume":"5","author":"Bermond","year":"1981","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00066-0_BIB3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0095-8956(74)90091-4","article-title":"The square of every two-connected graph is Hamiltonian","volume":"3","author":"Fleischner","year":"1974","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0012-365X(96)00066-0_BIB4","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0166-218X(94)90107-4","article-title":"Remarks on Hamiltonian properties of powers of digraphs","volume":"51","author":"Schaar","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(96)00066-0_BIB5","first-page":"137","article-title":"On ordering of the set of vertices of a connected graph","volume":"142","author":"Sekanina","year":"1960","journal-title":"Publ. Fac. Univ. Brno"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96000660?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96000660?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:28:50Z","timestamp":1556396930000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96000660"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":5,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["S0012365X96000660"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00066-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}