{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,21]],"date-time":"2023-06-21T04:11:01Z","timestamp":1687320661896},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","issue":"Graph and Algorithms","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"Graphs and Algorithms<\/jats:p>\n In this work we investigate the algorithmic complexity of computing a minimum C(k)-transversal, i.e., a subset of vertices that intersects all the chordless cycles with k vertices of the input graph, for a fixed k \\textgreater= 3. For graphs of maximum degree at most three, we prove that this problem is polynomial-time solvable when k \\textless= 4, and NP-hard otherwise. For graphs of maximum degree at most four, we prove that this problem is NP-hard for any fixed k \\textgreater= 3. We also discuss polynomial-time approximation algorithms for computing C(3)-transversals in graphs of maximum degree at most four, based on a new decomposition theorem for such graphs that leads to useful reduction rules.<\/jats:p>","DOI":"10.46298\/dmtcs.533","type":"journal-article","created":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T21:48:06Z","timestamp":1629755286000},"source":"Crossref","is-referenced-by-count":0,"title":["Cycle transversals in bounded degree graphs"],"prefix":"10.46298","volume":"Vol. 13 no. 1","author":[{"given":"Marina","family":"Groshaus","sequence":"first","affiliation":[{"name":"Departamento de Computaci\u00f3n [Buenos Aires]"}]},{"given":"Pavol","family":"Hell","sequence":"additional","affiliation":[{"name":"Simon Fraser University"}]},{"given":"Sulamita","family":"Klein","sequence":"additional","affiliation":[{"name":"Instituto de Matem\u00e1tica da Universidade Federal do Rio de Janeiro"}]},{"given":"Loana Tito","family":"Nogueira","sequence":"additional","affiliation":[{"name":"Fluminense Federal University [Niter\u00f3i]"}]},{"given":"F\u00e1bio","family":"Protti","sequence":"additional","affiliation":[{"name":"Fluminense Federal University [Niter\u00f3i]"}]}],"member":"25203","published-online":{"date-parts":[[2011,3,4]]},"container-title":["Discrete Mathematics & Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dmtcs.episciences.org\/533\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dmtcs.episciences.org\/533\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:09:02Z","timestamp":1687291742000},"score":1,"resource":{"primary":{"URL":"https:\/\/dmtcs.episciences.org\/533"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,4]]},"references-count":0,"journal-issue":{"issue":"Graph and Algorithms","published-online":{"date-parts":[[2011,3,4]]}},"URL":"https:\/\/doi.org\/10.46298\/dmtcs.533","relation":{"is-same-as":[{"id-type":"uri","id":"https:\/\/hal.science\/hal-00990477v1","asserted-by":"subject"}]},"ISSN":["1365-8050"],"issn-type":[{"value":"1365-8050","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,4]]}}}