{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T05:03:44Z","timestamp":1772600624312,"version":"3.50.1"},"reference-count":5,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1981,6,1]],"date-time":"1981-06-01T00:00:00Z","timestamp":360201600000},"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":11734,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1981,6]]},"DOI":"10.1016\/0095-8956(81)90050-2","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T09:37:08Z","timestamp":1107941828000},"page":"332-342","source":"Crossref","is-referenced-by-count":26,"title":["Cycles in bipartite graphs"],"prefix":"10.1016","volume":"30","author":[{"given":"Bill","family":"Jackson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(81)90050-2_BIB1","first-page":"69","article-title":"Some theorems on abstract graphs","volume":"2","author":"Dirac","year":"1952"},{"key":"10.1016\/0095-8956(81)90050-2_BIB2","series-title":"Proc. Ninth Southeastern Conf. on Combinatorics, Graph Theory and Computing","first-page":"391","article-title":"Cycles in bipartite graphs","author":"Jackson","year":"1978"},{"key":"10.1016\/0095-8956(81)90050-2_BIB3","first-page":"355","article-title":"On circuits of finite graphs","volume":"8","author":"P\u00f3sa","year":"1963","journal-title":"Magyar Tud. Akad. Kutato Int. K\u00f6zl."},{"key":"10.1016\/0095-8956(81)90050-2_BIB4","unstructured":"J. Sheehan, personal communication."},{"key":"10.1016\/0095-8956(81)90050-2_BIB5","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/S0021-9800(66)80054-6","article-title":"On minimal graphs of maximum even girth","volume":"1","author":"Singleton","year":"1966","journal-title":"J. Combin. Theory"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895681900502?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895681900502?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T11:23:30Z","timestamp":1548761010000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895681900502"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,6]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981,6]]}},"alternative-id":["0095895681900502"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(81)90050-2","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1981,6]]}}}