{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T05:39:31Z","timestamp":1671773971225},"reference-count":8,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1994,6,1]],"date-time":"1994-06-01T00:00:00Z","timestamp":770428800000},"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":6986,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1994,6]]},"DOI":"10.1016\/0166-218x(94)90097-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"95-102","source":"Crossref","is-referenced-by-count":1,"title":["Hamiltonicity of bipartite biclaw-free graphs"],"prefix":"10.1016","volume":"51","author":[{"given":"E.","family":"Flandrin","sequence":"first","affiliation":[]},{"given":"J.L.","family":"Fouquet","sequence":"additional","affiliation":[]},{"given":"H.","family":"Li","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)90097-3_BIB1","series-title":"Ph.D. Thesis","author":"Ash","year":"1985"},{"key":"10.1016\/0166-218X(94)90097-3_BIB2","first-page":"81","article-title":"Dominating cycles in bipartite graphs","author":"Ash","year":"1984"},{"key":"10.1016\/0166-218X(94)90097-3_BIB3","unstructured":"D. Barraez, E. Flandrin, H. Li and O. Ordaz, Dominating cycles in bipartite biclaw-free graphs, preprint."},{"key":"10.1016\/0166-218X(94)90097-3_BIB4","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0166-218X(94)90097-3_BIB5","article-title":"On hamiltonian claw-free graphs","author":"Flandrin","year":"1990","journal-title":"Proceedings of the 4th Conference of Graph Theory and Combinatorics, Luminy"},{"key":"10.1016\/0166-218X(94)90097-3_BIB6","article-title":"Unsolved problem","author":"H\u00e4ggkvist","year":"1976","journal-title":"Proceedings Fifth Hungarian Colloquium on Combinatorics"},{"key":"10.1016\/0166-218X(94)90097-3_BIB7","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/jgt.3190080116","article-title":"Hamiltonian results in K1, 3-free graphs","volume":"8","author":"Matthews","year":"1984","journal-title":"J. Graph Theory"},{"key":"10.1016\/0166-218X(94)90097-3_BIB8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1002\/jgt.3190090208","article-title":"Longest paths and cycles in K1, 3-free graphs","volume":"9","author":"Matthews","year":"1985","journal-title":"J. Graph Theory"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94900973?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94900973?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,3,23]],"date-time":"2021-03-23T02:16:19Z","timestamp":1616465779000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94900973"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,6]]},"references-count":8,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1994,6]]}},"alternative-id":["0166218X94900973"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)90097-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,6]]}}}