乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:48:23Z","timestamp":1720201703060},"reference-count":11,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12001296","12111540249","12161141006"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006606","name":"Natural Science Foundation of Tianjin City","doi-asserted-by":"publisher","award":["20JCJQJC00090","20JCZDJC00840","21JCQNJC00060"],"id":[{"id":"10.13039\/501100006606","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1016\/j.tcs.2023.113941","type":"journal-article","created":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T15:45:38Z","timestamp":1683560738000},"page":"113941","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["On the saturation spectrum of families of cycle subdivisions"],"prefix":"10.1016","volume":"962","author":[{"given":"Rongling","family":"Lang","sequence":"first","affiliation":[]},{"given":"Hui","family":"Lei","sequence":"additional","affiliation":[]},{"given":"Junxue","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2023.113941_br0010","first-page":"233","article-title":"The edge spectrum of K4-saturated graphs","volume":"81","author":"Amin","year":"2012","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"10.1016\/j.tcs.2023.113941_br0020","doi-asserted-by":"crossref","first-page":"9","DOI":"10.7151\/dmgt.1654","article-title":"On the non-(p\u22121)-partite Kp-free graphs","volume":"33","author":"Amin","year":"2013","journal-title":"Discuss. Math., Graph Theory"},{"issue":"4","key":"10.1016\/j.tcs.2023.113941_br0030","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1002\/jgt.22256","article-title":"On the edge spectrum of saturated graphs for paths and stars","volume":"89","author":"Balister","year":"2018","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.tcs.2023.113941_br0040","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0012-365X(94)00190-T","article-title":"Size in maximal triangle-free graphs and minimal graphs of diameter 2","volume":"138","author":"Barefoot","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2023.113941_br0050","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02024498","article-title":"On maximal paths and circuits of graphs","volume":"10","author":"Erd\u0151s","year":"1959","journal-title":"Acta Math. Acad. Sci. Hung."},{"issue":"4","key":"10.1016\/j.tcs.2023.113941_br0060","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1002\/jgt.21625","article-title":"Saturation numbers for families of graph subdivisions","volume":"71","author":"Ferrara","year":"2012","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.tcs.2023.113941_br0070","doi-asserted-by":"crossref","first-page":"1723","DOI":"10.1007\/s00373-018-1978-5","article-title":"The edge spectrum of K4\u2212 -saturated graphs","volume":"34","author":"Gao","year":"2018","journal-title":"Graphs Comb."},{"key":"10.1016\/j.tcs.2023.113941_br0080","doi-asserted-by":"crossref","first-page":"2682","DOI":"10.1016\/j.disc.2012.01.012","article-title":"The edge spectrum of the saturation number for small paths","volume":"312","author":"Gould","year":"2012","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2023.113941_br0090","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2021.112565","article-title":"Minimizing the number of edges in C\u2265r-saturated graphs","volume":"344","author":"Ma","year":"2021","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2023.113941_br0100","series-title":"Introduction to Graph Theory","author":"West","year":"2001"},{"key":"10.1016\/j.tcs.2023.113941_br0110","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01902497","article-title":"Maximal circuits of graphs, I","volume":"28","author":"Woodall","year":"1976","journal-title":"Acta Math. Acad. Sci. Hung."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397523002542?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397523002542?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,10]],"date-time":"2024-04-10T01:22:55Z","timestamp":1712712175000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397523002542"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6]]},"references-count":11,"alternative-id":["S0304397523002542"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2023.113941","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2023,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the saturation spectrum of families of cycle subdivisions","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2023.113941","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"113941"}}