{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:46:04Z","timestamp":1720640764848},"reference-count":14,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s1571-0653(04)00056-3","type":"journal-article","created":{"date-parts":[[2004,10,15]],"date-time":"2004-10-15T15:21:27Z","timestamp":1097853687000},"page":"81-88","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["No Cycling in the Graphs!"],"prefix":"10.1016","volume":"11","author":[{"given":"Lowell W.","family":"Beineke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert C.","family":"Vandell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00056-3_NEWBIB1","first-page":"51","article-title":"The acyclic chromatic number","volume":"17","author":"Albertson","year":"1976","journal-title":"Congr. Numer"},{"key":"10.1016\/S1571-0653(04)00056-3_NEWBIB2","unstructured":"N. Alon, Induced acyclic subgraphs in sparse bipartite graphs (to appear)."},{"key":"10.1016\/S1571-0653(04)00056-3_NEWBIB3","unstructured":"N. Alon, D. Mubayi, and R. Thomas, Large induced forests in sparse graphs (to appear)."},{"key":"10.1016\/S1571-0653(04)00056-3_NEWBIB4","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1137\/S0895480196305124","article-title":"A 2-approximation algorithm for the undirected feedback vertex set problem","volume":"12","author":"Bafna","year":"1999","journal-title":"SIAM J. Discrete Math"},{"key":"10.1016\/S1571-0653(04)00056-3_NEWBIB5","unstructured":"S. Bau, L. W. Beineke, Z. Liu, G. Du, and R. C. Vandell, Decycling cubes and grids (to appear)."},{"key":"10.1016\/S1571-0653(04)00056-3_NEWBIB6","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/(SICI)1097-0118(199705)25:1<59::AID-JGT4>3.0.CO;2-H","article-title":"Decycling Graphs","volume":"25","author":"Beineke","year":"1997","journal-title":"J. Graph Theory"},{"key":"10.1016\/S1571-0653(04)00056-3_NEWBIB7","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0012-365X(79)90077-3","article-title":"On acyclic colorings of planar graphs","volume":"25","author":"Borodin","year":"1979","journal-title":"Discrete Math"},{"key":"10.1016\/S1571-0653(04)00056-3_NEWBIB8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0095-8956(86)90028-6","article-title":"Maximum induced trees in graphs","volume":"41","author":"Erd\u00f6s","year":"1986","journal-title":"J. Combin. Theory (B)"},{"key":"10.1016\/S1571-0653(04)00056-3_NEWBIB9","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S1571-0653(04)00056-3_NEWBIB10","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1002\/andp.18471481202","article-title":"\u00dcber die Aufl\u00f6sung der Gleichungenauf welche man bei der Untersuchung der linearen Verteilung galvanischer Str\u00f6me gef\u00fchrt wird","volume":"72","author":"Kirchhoff","year":"1847","journal-title":"Ann. Phys. Chem"},{"key":"10.1016\/S1571-0653(04)00056-3_NEWBIB11","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0020-0190(94)00133-2","article-title":"On the feedback vertex set problem in permutation graphs","volume":"52","author":"Liang","year":"1994","journal-title":"Inform. Process. Lett"},{"key":"10.1016\/S1571-0653(04)00056-3_NEWBIB12","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s002360050088","article-title":"Minimum feedback vertex sets in cocomparability graphs and convex bipartite graphs","volume":"34","author":"Liang","year":"1997","journal-title":"Acta Inform"},{"key":"10.1016\/S1571-0653(04)00056-3_NEWBIB13","first-page":"719","article-title":"Bounds on feedback vertex sets of undirected cubic graphs, Algebra, Combinatorics and Logic in Computer Science","volume":"42","author":"Speckenmeyer","year":"1986"},{"key":"10.1016\/S1571-0653(04)00056-3_NEWBIB14","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"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304000563?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304000563?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T02:54:51Z","timestamp":1549162491000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304000563"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":14,"alternative-id":["S1571065304000563"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00056-3","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}