{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T21:52:33Z","timestamp":1663105953011},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"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":8539,"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":[[1990,3]]},"DOI":"10.1016\/0012-365x(90)90116-y","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:46:59Z","timestamp":1027640819000},"page":"159-165","source":"Crossref","is-referenced-by-count":9,"title":["Sufficient conditions for a graph to have factors"],"prefix":"10.1016","volume":"80","author":[{"given":"Mikio","family":"Kano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(90)90116-Y_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.3190090103","article-title":"Factors and factorizations of graphs\u2014A survey","volume":"9","author":"Akiyama","year":"1985","journal-title":"J. of Graph Theory"},{"key":"10.1016\/0012-365X(90)90116-Y_BIB2","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BF01214296","article-title":"\u00dcber die Zerlegung regul\u00e4rer Streckenkomplexe ungerader Ordnung","volume":"10","author":"B\u00e4bler","year":"1938","journal-title":"Comment. Math. Helverici"},{"key":"10.1016\/0012-365X(90)90116-Y_BIB3","author":"Behzad","year":"1979"},{"key":"10.1016\/0012-365X(90)90116-Y_BIB4","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0012-365X(84)90030-X","article-title":"Regular factors in nearly regular graphs","volume":"50","author":"Bermond","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90116-Y_BIB5","author":"Bondy","year":"1976"},{"key":"10.1016\/0012-365X(90)90116-Y_BIB6","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF02022560","article-title":"On factorisation of graphs","volume":"1","author":"Gallai","year":"1950","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"10.1016\/0012-365X(90)90116-Y_BIB7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0012-365X(75)90085-0","article-title":"On defect d-matchings in graphs","volume":"13","author":"Little","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90116-Y_BIB8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/jgt.3190090111","article-title":"[a, b]-factorization of a graph","volume":"9","author":"Kano","year":"1985","journal-title":"J. of Graph Theory"},{"key":"10.1016\/0012-365X(90)90116-Y_BIB9","first-page":"161","article-title":"Graph factors with given properties","author":"Kano","year":"1983","journal-title":"Springer Lecture Notes in Math. No. 1073"},{"key":"10.1016\/0012-365X(90)90116-Y_BIB10","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/S0021-9800(70)80033-3","article-title":"Subgraphs with prescribed valencies","volume":"8","author":"Lov\u00e1sz","year":"1970","journal-title":"J. of Combinat. Theory"},{"key":"10.1016\/0012-365X(90)90116-Y_BIB11","doi-asserted-by":"crossref","first-page":"314","DOI":"10.4153\/CJM-1952-028-2","article-title":"The factors of graphs","volume":"4","author":"Tutte","year":"1952","journal-title":"Canad. J. Math."},{"key":"10.1016\/0012-365X(90)90116-Y_BIB12","doi-asserted-by":"crossref","first-page":"347","DOI":"10.4153\/CJM-1954-033-3","article-title":"A short proof of the factor theorem for finite graphs","volume":"6","author":"Tutte","year":"1954","journal-title":"Canad. J. Math."},{"key":"10.1016\/0012-365X(90)90116-Y_BIB13","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF02579180","article-title":"Graph factors","volume":"1","author":"Tutte","year":"1981","journal-title":"Combinatorica"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090116Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090116Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:25:14Z","timestamp":1555115114000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9090116Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["0012365X9090116Y"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(90)90116-y","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}