乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T11:10:24Z","timestamp":1730459424535,"version":"3.28.0"},"reference-count":9,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1016\/j.jctb.2020.07.001","type":"journal-article","created":{"date-parts":[[2020,7,14]],"date-time":"2020-07-14T14:59:51Z","timestamp":1594738791000},"page":"433-449","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["The pseudoforest analogue for the Strong Nine Dragon Tree Conjecture is true"],"prefix":"10.1016","volume":"145","author":[{"given":"Logan","family":"Grout","sequence":"first","affiliation":[]},{"given":"Benjamin","family":"Moore","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"2008","series-title":"Graph Theory","author":"Bondy","key":"10.1016\/j.jctb.2020.07.001_br0010"},{"key":"10.1016\/j.jctb.2020.07.001_br0020","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.jctb.2015.05.003","article-title":"Decomposing a graph into pseudoforests with one having bounded degree","volume":"115","author":"Fan","year":"2015","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"4","key":"10.1016\/j.jctb.2020.07.001_br0030","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/0016-0032(65)90340-6","article-title":"On the degrees of the vertices of a directed graph","volume":"279","author":"Hakimi","year":"1965","journal-title":"J. Franklin Inst."},{"issue":"6","key":"10.1016\/j.jctb.2020.07.001_br0040","doi-asserted-by":"crossref","first-page":"1125","DOI":"10.1007\/s00493-016-3390-1","article-title":"Decomposing a graph into forests: the nine dragon tree conjecture is true","volume":"37","author":"Jiang","year":"2017","journal-title":"Combinatorica"},{"issue":"4","key":"10.1016\/j.jctb.2020.07.001_br0050","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1002\/jgt.21711","article-title":"Decomposition of sparse graphs into forests and a graph with bounded degree","volume":"74","author":"Kim","year":"2013","journal-title":"J. Graph Theory"},{"issue":"1","key":"10.1016\/j.jctb.2020.07.001_br0060","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.jctb.2011.04.001","article-title":"Decomposing a graph into forests","volume":"102","author":"Montassier","year":"2012","journal-title":"J. Comb. Theory, Ser. B"},{"author":"Moore","key":"10.1016\/j.jctb.2020.07.001_br0070"},{"issue":"1","key":"10.1016\/j.jctb.2020.07.001_br0080","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1112\/jlms\/s1-39.1.12","article-title":"Decomposition of finite graphs into forests","volume":"s1\u201339","author":"Nash-Williams","year":"1964","journal-title":"J. Lond. Math. Soc."},{"key":"10.1016\/j.jctb.2020.07.001_br0090","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.jctb.2018.01.005","article-title":"Decomposing a graph into forests and a matching","volume":"131","author":"Yang","year":"2018","journal-title":"J. Comb. Theory, Ser. B"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S009589562030068X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S009589562030068X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T10:36:31Z","timestamp":1730457391000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S009589562030068X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11]]},"references-count":9,"alternative-id":["S009589562030068X"],"URL":"https:\/\/doi.org\/10.1016\/j.jctb.2020.07.001","relation":{},"ISSN":["0095-8956"],"issn-type":[{"type":"print","value":"0095-8956"}],"subject":[],"published":{"date-parts":[[2020,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The pseudoforest analogue for the Strong Nine Dragon Tree Conjecture is true","name":"articletitle","label":"Article Title"},{"value":"Journal of Combinatorial Theory, Series B","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jctb.2020.07.001","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier Inc.","name":"copyright","label":"Copyright"}]}}