{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T09:27:01Z","timestamp":1778750821017,"version":"3.51.4"},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"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":5737,"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":[[1997,11]]},"DOI":"10.1016\/s0012-365x(96)00299-3","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"149-158","source":"Crossref","is-referenced-by-count":12,"title":["Maximum genus and maximum nonseparating independent set of a 3-regular graph"],"prefix":"10.1016","volume":"176","author":[{"given":"Yuangqiu","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanpei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00299-3_BIB1","series-title":"Graph Theory with Application","author":"Bondy","year":"1976"},{"key":"10.1016\/S0012-365X(96)00299-3_BIB2","doi-asserted-by":"crossref","unstructured":"M.L. Furst, J.L. Gross and L.A. Megeoch, Finding a maximum-genus graphs imbedding, J. ACM 35, 22\u201336.","DOI":"10.1145\/44483.44485"},{"key":"10.1016\/S0012-365X(96)00299-3_BIB3","unstructured":"Y. Huang and Y. Liu, Extensions on 3-regular up-embeddable graphs without cut-edge, to appear."},{"key":"10.1016\/S0012-365X(96)00299-3_BIB4","series-title":"Eembeddability in Graphs","author":"Liu","year":"1995"},{"key":"10.1016\/S0012-365X(96)00299-3_BIB5","series-title":"Algebraic Methods in Graph Theory, II","first-page":"495","article-title":"The matroid matching problem","volume":"Vol. 25","author":"Lovasz","year":"1981"},{"key":"10.1016\/S0012-365X(96)00299-3_BIB6","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/0095-8956(71)90036-0","article-title":"On the maximum genus of a graph","volume":"11","author":"Nordhaus","year":"1971","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0012-365X(96)00299-3_BIB7","series-title":"Algebra, Combinatorics and Logic in Computer Science","first-page":"719","article-title":"Bounds on feedback vertex sets of undirected cubic graphs","volume":"Vol. 42","author":"Speckenmeyer","year":"1983"},{"issue":"3","key":"10.1016\/S0012-365X(96)00299-3_BIB8","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\/S0012-365X(96)00299-3_BIB9","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\/S0012-365X(96)00299-3_BIB10","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 set problem for graphs with no vertex degree exceeding three","volume":"72","author":"Ueno","year":"1988","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00299-3_BIB11","first-page":"216","article-title":"How to determine the maximum genus of a graph","volume":"26","author":"Xuong","year":"1979","journal-title":"J. Combin. Theory Ser B"},{"key":"10.1016\/S0012-365X(96)00299-3_BIB12","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0012-365X(90)90165-E","article-title":"On the maximum induced forests of a connected cubic graphs without triangle","volume":"85","author":"Zheng","year":"1990","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96002993?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96002993?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:29:27Z","timestamp":1556130567000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96002993"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["S0012365X96002993"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00299-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}