{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T16:15:32Z","timestamp":1786983332044,"version":"3.56.0"},"reference-count":5,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8994,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1988,12]]},"DOI":"10.1016\/0012-365x(88)90226-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:43Z","timestamp":1027640623000},"page":"355-360","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":87,"title":["On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three"],"prefix":"10.1016","volume":"72","author":[{"given":"Shuichi","family":"Ueno","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yoji","family":"Kajitani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shin'ya","family":"Gotoh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(88)90226-9_BIB1","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"10.1016\/0012-365X(88)90226-9_BIB2","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1137\/0132071","article-title":"The rectilinear Steiner problem is NP-complete","volume":"32","author":"Garey","year":"1977","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0012-365X(88)90226-9_BIB3","series-title":"Computers and intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0012-365X(88)90226-9_BIB4","first-page":"495","article-title":"The matroid matching problem","volume":"25","author":"Lov\u00e1sz","year":"1981"},{"key":"10.1016\/0012-365X(88)90226-9_BIB5","first-page":"719","article-title":"Bounds on feedback vertex sets of undirected cubic graphs","volume":"42","author":"Speckenmeyer","year":"1986"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X88902269?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X88902269?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T13:35:18Z","timestamp":1757079318000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X88902269"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,12]]},"references-count":5,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1988,12]]}},"alternative-id":["0012365X88902269"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(88)90226-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1988,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0012-365X(88)90226-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1988 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}