{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T04:54:11Z","timestamp":1776401651005,"version":"3.51.2"},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1984,8,1]],"date-time":"1984-08-01T00:00:00Z","timestamp":460166400000},"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":10577,"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":[[1984,8]]},"DOI":"10.1016\/0095-8956(84)90044-3","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T14:37:08Z","timestamp":1107959828000},"page":"53-63","source":"Crossref","is-referenced-by-count":11,"title":["Maximum graphs with a unique k-factor"],"prefix":"10.1016","volume":"37","author":[{"given":"G.R.T","family":"Hendry","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(84)90044-3_BIB1","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1002\/jgt.3190050313","article-title":"A census of maximal uniquely hamiltonian graphs","volume":"5","author":"Barefoot","year":"1981","journal-title":"J. Graph Theory"},{"key":"10.1016\/0095-8956(84)90044-3_BIB2","author":"Behzad","year":"1979"},{"key":"10.1016\/0095-8956(84)90044-3_BIB3","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/S0021-9800(67)80029-2","article-title":"On the 1-factors of a nonseparable graph","volume":"2","author":"Beineke","year":"1967","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0095-8956(84)90044-3_BIB4","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01889914","article-title":"On the structure of factorizable graphs","volume":"23","author":"Lov\u00e1sz","year":"1972","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"10.1016\/0095-8956(84)90044-3_BIB5","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/jgt.3190010110","article-title":"Graphs with exactly one hamiltonian circuit","volume":"1","author":"Sheehan","year":"1977","journal-title":"J. Graph Theory"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895684900443?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895684900443?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T16:21:01Z","timestamp":1548778861000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895684900443"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,8]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1984,8]]}},"alternative-id":["0095895684900443"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(84)90044-3","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1984,8]]}}}