{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T06:47:00Z","timestamp":1765176420330},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,11,1]],"date-time":"1990-11-01T00:00:00Z","timestamp":657417600000},"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":8294,"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,11]]},"DOI":"10.1016\/0012-365x(90)90165-e","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:43Z","timestamp":1027640623000},"page":"89-96","source":"Crossref","is-referenced-by-count":19,"title":["On the maximum induced forests of a connected cubic graph without triangles"],"prefix":"10.1016","volume":"85","author":[{"given":"Maolin","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyun","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0012-365X(90)90165-E_BIB1","doi-asserted-by":"crossref","DOI":"10.4153\/CMB-1987-028-5","article-title":"Lower bounds for induced forests in cubic graphs","volume":"30","author":"Bondy","year":"1987","journal-title":"Canad. Math. Bull"},{"key":"10.1016\/0012-365X(90)90165-E_BIB2","first-page":"501","article-title":"On vertex-induced forests in cubic graphs","author":"Jaeger","year":"1974","journal-title":"Proc. 5th South East Conf. Combinatorics, Graph Theory, and Computing"},{"issue":"3","key":"10.1016\/0012-365X(90)90165-E_BIB3","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1002\/jgt.3190120311","article-title":"On feedback vertex sets and nonseparating independent sets in cubic graphs","volume":"12","author":"Speckenmeyer","year":"1988","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(90)90165-E_BIB4","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0012-365X(84)90115-8","article-title":"Induced forests in cubic graphs","volume":"49","author":"Staton","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90165-E_BIB5","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0012-365X(88)90226-9","article-title":"On the nonseparating independent set problem and feedback vertex set problem for graphs with no vertex degree exceeding three","volume":"72","author":"Ueno","year":"1988","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090165E?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090165E?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:55:28Z","timestamp":1555120528000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9090165E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,11]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,11]]}},"alternative-id":["0012365X9090165E"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(90)90165-e","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[1990,11]]}}}