{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T22:04:53Z","timestamp":1648850693253},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"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":5707,"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,12]]},"DOI":"10.1016\/s0012-365x(97)00005-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:36:38Z","timestamp":1027618598000},"page":"287-294","source":"Crossref","is-referenced-by-count":1,"title":["Long dominating cycles in graphs"],"prefix":"10.1016","volume":"177","author":[{"given":"Ruqun","family":"Shen","sequence":"first","affiliation":[]},{"given":"Feng","family":"Tian","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)00005-8_BIB1","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0012-365X(91)90468-H","article-title":"Hamiltonian properties of graphs with large neighborhood unions","volume":"96","author":"Bauer","year":"1991","journal-title":"Discrete Mathematics"},{"key":"10.1016\/S0012-365X(97)00005-8_BIB2","series-title":"Research Report CORR80-16","article-title":"Longest paths and cycles in graphs of high degree","author":"Bondy","year":"1980"},{"key":"10.1016\/S0012-365X(97)00005-8_BIB3","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0012-365X(97)00005-8_BIB4","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/jgt.3190150106","article-title":"Long dominating cycles and paths in graphs with large neighborhood unions","volume":"15","author":"Broersma","year":"1991","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(97)00005-8_BIB5","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0012-365X(93)00181-4","article-title":"Neighborhood unions and hamiltonicity of graphs","volume":"141","author":"Shen","year":"1995","journal-title":"Discrete Mathematics"},{"key":"10.1016\/S0012-365X(97)00005-8_BIB6","first-page":"66","article-title":"Long dominating cycles in a kind of 2-connected graphs","volume":"8","author":"Shen","year":"1995","journal-title":"System Science and Mathematical Sciences"},{"key":"10.1016\/S0012-365X(97)00005-8_BIB7","first-page":"27","article-title":"The circumferences in a kind of 3-connected graphs","volume":"9","author":"Zhang","year":"1992","journal-title":"J. Xinjiang University"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97000058?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97000058?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:50:09Z","timestamp":1556131809000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X97000058"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,12]]}},"alternative-id":["S0012365X97000058"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)00005-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,12]]}}}