{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:04Z","timestamp":1759063684252},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T00:00:00Z","timestamp":1078099200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3461,"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":[[2004,3]]},"DOI":"10.1016\/s0012-365x(03)00248-6","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T03:43:33Z","timestamp":1063338213000},"page":"127-138","source":"Crossref","is-referenced-by-count":5,"title":["On unique k-factors and unique [1,k]-factors in graphs"],"prefix":"10.1016","volume":"278","author":[{"given":"Arne","family":"Hoffmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lutz","family":"Volkmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00248-6_BIB1","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\/S0012-365X(03)00248-6_BIB2","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0095-8956(84)90044-3","article-title":"Maximum graphs with a unique k-factor","volume":"37","author":"Hendry","year":"1984","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0012-365X(03)00248-6_BIB3","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1002\/jgt.3190130507","article-title":"A note concerning graphs with unique k-factors","volume":"13","author":"Jackson","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(03)00248-6_BIB4","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1002\/1097-0118(200012)35:4<227::AID-JGT1>3.0.CO;2-D","article-title":"On the structure of graphs with a unique k-factor","volume":"35","author":"Johann","year":"2000","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(03)00248-6_BIB5","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/BF01456961","article-title":"\u00dcber Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre","volume":"77","author":"K\u00f6nig","year":"1916","journal-title":"Math. Ann."},{"key":"10.1016\/S0012-365X(03)00248-6_BIB6","first-page":"73","article-title":"On the theory of finite graphs with a linear factor II","volume":"9","author":"Kotzig","year":"1959","journal-title":"Mat. Fyz. C\u0306asopis Slovensk. Akad. Vied."},{"key":"10.1016\/S0012-365X(03)00248-6_BIB7","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\/S0012-365X(03)00248-6_BIB8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01428195","article-title":"1-Faktoren von Graphen","volume":"201","author":"Mader","year":"1973","journal-title":"Math. Ann."},{"key":"10.1016\/S0012-365X(03)00248-6_BIB9","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"},{"key":"10.1016\/S0012-365X(03)00248-6_BIB10","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1090\/S0002-9939-1953-0063009-7","article-title":"The 1-factors of oriented graphs","volume":"4","author":"Tutte","year":"1953","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/S0012-365X(03)00248-6_BIB11","doi-asserted-by":"crossref","unstructured":"L. Volkmann, Fundamente der Graphentheorie, Springer, Wien, New York, 1996, pp. 136\u2013137.","DOI":"10.1007\/978-3-7091-9449-2"},{"key":"10.1016\/S0012-365X(03)00248-6_BIB12","unstructured":"L. Volkmann, The maximum size of graphs with a unique k-factor, Combinatorica, to appear."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002486?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002486?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T22:14:28Z","timestamp":1682547268000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03002486"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,3]]}},"alternative-id":["S0012365X03002486"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00248-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}