乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T19:12:56Z","timestamp":1648667576424},"reference-count":23,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2015,5,1]],"date-time":"2015-05-01T00:00:00Z","timestamp":1430438400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T00:00:00Z","timestamp":1557100800000},"content-version":"vor","delay-in-days":1466,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"name":"JSPS KAKENHI","award":["25871053","P202\/12\/G061"]},{"name":"JSPS KAKENHI","award":["26400190"]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1016\/j.disc.2014.12.017","type":"journal-article","created":{"date-parts":[[2015,1,20]],"date-time":"2015-01-20T12:31:54Z","timestamp":1421757114000},"page":"793-808","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["2<\/mml:mn><\/mml:math>-factors with bounded number of components in claw-free graphs"],"prefix":"10.1016","volume":"338","author":[{"given":"Kenta","family":"Ozeki","sequence":"first","affiliation":[]},{"given":"Zden\u011bk","family":"Ryj\u00e1\u010dek","sequence":"additional","affiliation":[]},{"given":"Kiyoshi","family":"Yoshimoto","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2014.12.017_br000005","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/s00373-009-0855-7","article-title":"Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs","volume":"25","author":"Broersma","year":"2009","journal-title":"Graphs Combin."},{"key":"10.1016\/j.disc.2014.12.017_br000010","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s00373-013-1375-z","article-title":"2-Factors in claw-free graphs with lower bounds cycle lengths","volume":"31","author":"\u010cada","year":"2015","journal-title":"Graphs Combin."},{"key":"10.1016\/j.disc.2014.12.017_br000015","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/jgt.3190120105","article-title":"A reduction method to find spanning eulerian subgraphs","volume":"12","author":"Catlin","year":"1988","journal-title":"J.~Graph Theory"},{"key":"10.1016\/j.disc.2014.12.017_br000020","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1002\/jgt.3190150304","article-title":"Regular factors in K1,3-free graphs","volume":"15","author":"Choudum","year":"1991","journal-title":"J.~Graph Theory"},{"key":"10.1016\/j.disc.2014.12.017_br000025","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1002\/jgt.3190150310","article-title":"Regular factors in K1,n-free graphs","volume":"15","author":"Egawa","year":"1991","journal-title":"J.~Graph Theory"},{"key":"10.1016\/j.disc.2014.12.017_br000030","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0012-365X(98)00398-7","article-title":"On 2-factors in claw-free graphs","volume":"206","author":"Faudree","year":"1999","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2014.12.017_br000035","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0012-365X(96)00045-3","article-title":"Claw-free graphs\u2013a survey","volume":"164","author":"Faudree","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2014.12.017_br000040","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1002\/jgt.20579","article-title":"Claw-free graphs and 2-factors that separate independent vertices","volume":"69","author":"Faudree","year":"2012","journal-title":"J.~Graph Theory"},{"key":"10.1016\/j.disc.2014.12.017_br000045","first-page":"46","article-title":"A note on cycles in 2-factors of line graphs","volume":"26","author":"Gould","year":"1999","journal-title":"Bull. Inst. Combin. Appl."},{"key":"10.1016\/j.disc.2014.12.017_br000050","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/S0012-365X(00)00317-4","article-title":"Two-factors with few cycles in claw-free graphs","volume":"231","author":"Gould","year":"2001","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2014.12.017_br000055","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1002\/jgt.20099","article-title":"Hamilton connectivity of line graphs and claw-free graphs","volume":"50","author":"Hu","year":"2005","journal-title":"J.~Graph Theory"},{"key":"10.1016\/j.disc.2014.12.017_br000060","unstructured":"B. Jackson, Hamilton cycles in 7-connected line graphs (1989), preprint."},{"key":"10.1016\/j.disc.2014.12.017_br000065","doi-asserted-by":"crossref","first-page":"2775","DOI":"10.1016\/j.disc.2006.11.023","article-title":"Even subgraphs of bridgeless graphs and 2-factors of line graphs","volume":"307","author":"Jackson","year":"2007","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2014.12.017_br000070","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/jgt.20386","article-title":"Spanning even subgraphs of 3-edge-connected graphs","volume":"62","author":"Jackson","year":"2009","journal-title":"J.~Graph Theory"},{"key":"10.1016\/j.disc.2014.12.017_br000075","doi-asserted-by":"crossref","first-page":"924","DOI":"10.1016\/j.ejc.2011.09.015","article-title":"Hamilton cycles in 5-connected line graphs","volume":"33","author":"Kaiser","year":"2012","journal-title":"European J.~Combin."},{"key":"10.1016\/j.disc.2014.12.017_br000080","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/j.disc.2011.08.020","article-title":"2-factors and independent sets on claw-free graphs","volume":"312","author":"Ku\u017eel","year":"2012","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2014.12.017_br000085","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\/j.disc.2014.12.017_br000090","first-page":"217","article-title":"On a closure concept in claw-free graphs","volume":"70","author":"Ryj\u00e1\u010dek","year":"1997","journal-title":"J.~Combin.~Theory Ser.~B"},{"key":"10.1016\/j.disc.2014.12.017_br000095","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/(SICI)1097-0118(199910)32:2<109::AID-JGT1>3.0.CO;2-O","article-title":"Closure, 2-factor, and cycle coverings in claw-free graphs","volume":"32","author":"Ryj\u00e1\u010dek","year":"1999","journal-title":"J.~Graph Theory"},{"key":"10.1016\/j.disc.2014.12.017_br000100","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/jgt.3190100308","article-title":"Reflections on graph theory","volume":"10","author":"Thomassen","year":"1986","journal-title":"J.~Graph Theory"},{"key":"10.1016\/j.disc.2014.12.017_br000105","doi-asserted-by":"crossref","first-page":"2808","DOI":"10.1016\/j.disc.2006.11.022","article-title":"On the number of components in 2-factors of claw-free graphs","volume":"307","author":"Yoshimoto","year":"2007","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2014.12.017_br000110","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0012-365X(91)90401-M","article-title":"On hamiltonian line graphs and connectivity","volume":"89","author":"Zhan","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2014.12.017_br000115","doi-asserted-by":"crossref","first-page":"1971","DOI":"10.1016\/j.dam.2010.07.011","article-title":"Hamiltonicity of 6-connected line graphs","volume":"158","author":"Zhan","year":"2010","journal-title":"Discrete Appl.~Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X14004646?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X14004646?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T13:01:27Z","timestamp":1557147687000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X14004646"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["S0012365X14004646"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2014.12.017","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2015,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"-factors with bounded number of components in claw-free graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2014.12.017","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}