{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T04:18:07Z","timestamp":1649218687088},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"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":6072,"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":[[1996,12]]},"DOI":"10.1016\/0012-365x(95)00028-u","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"207-215","source":"Crossref","is-referenced-by-count":1,"title":["Hamiltonian properties and the bipartite independence number"],"prefix":"10.1016","volume":"161","author":[{"given":"Oscar","family":"Ordaz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Denise","family":"Amar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Raspaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00028-U_BIB1","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/0095-8956(90)90081-A","article-title":"Cycles and paths of many lengths in bipartite digraphs","volume":"50","author":"Amar","year":"1990","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(95)00028-U_BIB2","first-page":"33","article-title":"Two sufficient conditions for the existence of hamiltonian cycles in bipartite graphs","volume":"16A","author":"Ash","year":"1983","journal-title":"Ars Combin."},{"key":"10.1016\/0012-365X(95)00028-U_BIB3","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0012-365X(93)90537-4","article-title":"On the bipartite independence number of a balanced bipartite graph","volume":"121","author":"Favaron","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00028-U_BIB4","unstructured":"P. Fraisse, D\u03bb-cycles and their applications for hamiltonian graphs, preprint."},{"key":"10.1016\/0012-365X(95)00028-U_BIB5","first-page":"1","article-title":"Circuits through specified edges","volume":"1","author":"Haggkvist","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00028-U_BIB6","series-title":"A survey","first-page":"241","article-title":"Chvatal-Erd\u00f6s conditions for paths and cycles in graphs and digraphs","volume":"84","author":"Jackson","year":"1990"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500028U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500028U?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:26:07Z","timestamp":1556130367000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9500028U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["0012365X9500028U"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00028-u","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}