{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:20:33Z","timestamp":1742984433481,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030868376"},{"type":"electronic","value":"9783030868383"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86838-3_16","type":"book-chapter","created":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T22:05:30Z","timestamp":1632089130000},"page":"207-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Feedback Vertex Set on Hamiltonian Graphs"],"prefix":"10.1007","author":[{"given":"Dario","family":"Cavallaro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2203-4386","authenticated-orcid":false,"given":"Till","family":"Fluschnik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,20]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-4529-6","volume-title":"A Textbook of Graph Theory","author":"R Balakrishnan","year":"2012","unstructured":"Balakrishnan, R., Ranganathan, K.: A Textbook of Graph Theory. Springer, New York (2012). https:\/\/doi.org\/10.1007\/978-1-4614-4529-6"},{"issue":"4","key":"16_CR2","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0020-0190(95)00020-D","volume":"54","author":"M Chrobak","year":"1995","unstructured":"Chrobak, M., Payne, T.H.: A linear-time algorithm for drawing a planar graph on a grid. Inf. Process. Lett. 54(4), 241\u2013246 (1995). https:\/\/doi.org\/10.1016\/0020-0190(95)00020-D","journal-title":"Inf. Process. Lett."},{"doi-asserted-by":"publisher","unstructured":"Dailey, D.P.: Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete. Discrete Math. 30(3), 289\u2013293 (1980). https:\/\/doi.org\/10.1016\/0012-365X(80)90236-8. https:\/\/www.sciencedirect.com\/science\/article\/pii\/0012365X80902368","key":"16_CR3","DOI":"10.1016\/0012-365X(80)90236-8"},{"key":"16_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3","volume-title":"Graph Theory, Graduate Texts in Mathematics","author":"R Diestel","year":"2010","unstructured":"Diestel, R.: Graph Theory, Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-662-53622-3","edition":"4"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-1-4757-3023-4_4","volume-title":"Handbook of Combinatorial Optimization","author":"P Festa","year":"1999","unstructured":"Festa, P., Pardalos, P.M., Resende, M.G.C.: Feedback set problems. In: Du, D., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 209\u2013258. Springer, New York (1999). https:\/\/doi.org\/10.1007\/978-1-4757-3023-4_4"},{"issue":"2","key":"16_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/jgt.10079","volume":"42","author":"H Fleischner","year":"2003","unstructured":"Fleischner, H., Sabidussi, G.: 3-colorability of 4-regular Hamiltonian graphs. J. Graph Theory 42(2), 125\u2013140 (2003). https:\/\/doi.org\/10.1002\/jgt.10079","journal-title":"J. Graph Theory"},{"issue":"20","key":"16_CR7","doi-asserted-by":"publisher","first-page":"2742","DOI":"10.1016\/j.disc.2010.05.028","volume":"310","author":"H Fleischner","year":"2010","unstructured":"Fleischner, H., Sabidussi, G., Sarvanov, V.I.: Maximum independent sets in 3- and 4-regular Hamiltonian graphs. Discrete Math. 310(20), 2742\u20132749 (2010). https:\/\/doi.org\/10.1016\/j.disc.2010.05.028","journal-title":"Discrete Math."},{"doi-asserted-by":"publisher","unstructured":"Fluschnik, T., Niedermeier, R., Rohm, V., Zschoche, P.: Multistage vertex cover. In: Proceedings of 14th IPEC. LIPIcs, vol. 148, pp. 14:1\u201314:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2019.14","key":"16_CR8","DOI":"10.4230\/LIPIcs.IPEC.2019.14"},{"doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Proceedings of a Symposium on the Complexity of Computer Computations, pp. 85\u2013103. The IBM Research Symposia Series, Plenum Press, New York (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","key":"16_CR9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"4","key":"16_CR10","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/S0252-9602(17)30520-9","volume":"19","author":"D Li","year":"1999","unstructured":"Li, D., Liu, Y.: A polynomial algorithm for finding the minimum feedback vertex set of a 3-regular simple graph 1. Acta Mathematica Scientia 19(4), 375\u2013381 (1999)","journal-title":"Acta Mathematica Scientia"},{"issue":"1\u20133","key":"16_CR11","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0012-365X(92)90639-W","volume":"100","author":"HM Mulder","year":"1992","unstructured":"Mulder, H.M.: Julius Petersen\u2019s theory of regular graphs. Discrete Math. 100(1\u20133), 157\u2013175 (1992). https:\/\/doi.org\/10.1016\/0012-365X(92)90639-W","journal-title":"Discrete Math."},{"issue":"6","key":"16_CR12","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1016\/j.disc.2017.01.006","volume":"340","author":"A Munaro","year":"2017","unstructured":"Munaro, A.: On line graphs of subcubic triangle-free graphs. Discrete Math. 340(6), 1210\u20131226 (2017). https:\/\/doi.org\/10.1016\/j.disc.2017.01.006","journal-title":"Discrete Math."},{"doi-asserted-by":"crossref","unstructured":"Ng, L., Schultz, M.: $$k$$-ordered Hamiltonian graphs. J. Graph Theory 24(1), 45\u201357 (1997). https:\/\/doi.org\/10.1002\/(SICI)1097-0118(199701)24:1<45::AID-JGT6>3.0.CO;2-J","key":"16_CR13","DOI":"10.1002\/(SICI)1097-0118(199701)24:1<45::AID-JGT6>3.0.CO;2-J"},{"unstructured":"Speckenmeyer, E.: Untersuchungen zum Feedback Vertex Set Problem in ungerichteten Graphen. Ph.D. thesis, Paderborn (1983)","key":"16_CR14"},{"issue":"3","key":"16_CR15","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1002\/jgt.3190120311","volume":"12","author":"E Speckenmeyer","year":"1988","unstructured":"Speckenmeyer, E.: On feedback vertex sets and nonseparating independent sets in cubic graphs. J. Graph Theory 12(3), 405\u2013412 (1988). https:\/\/doi.org\/10.1002\/jgt.3190120311","journal-title":"J. Graph Theory"},{"issue":"1\u20133","key":"16_CR16","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/0012-365X(88)90226-9","volume":"72","author":"S Ueno","year":"1988","unstructured":"Ueno, S., Kajitani, Y., Gotoh, S.: On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three. Discrete Math. 72(1\u20133), 355\u2013360 (1988). https:\/\/doi.org\/10.1016\/0012-365X(88)90226-9","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86838-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T20:02:35Z","timestamp":1702065755000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86838-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030868376","9783030868383"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86838-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"47","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair and OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held online due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}