{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:47:57Z","timestamp":1742935677488,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030115081"},{"type":"electronic","value":"9783030115098"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-11509-8_19","type":"book-chapter","created":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T14:54:48Z","timestamp":1547823288000},"page":"231-244","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["H-Free Coloring on Graphs with Bounded Tree-Width"],"prefix":"10.1007","author":[{"given":"N. R.","family":"Aravind","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subrahmanyam","family":"Kalyanasundaram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anjeneya Swami","family":"Kare","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,19]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0012-365X(97)84217-3","volume":"165-166","author":"Demetrios Achlioptas","year":"1997","unstructured":"Achlioptas, D.: The complexity of G-free colourability. Discret. Math. 165\u2013166(Supplement C), 21\u201330 (1997)","journal-title":"Discrete Mathematics"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.endm.2013.07.041","volume":"43","author":"E Kubicka","year":"2013","unstructured":"Kubicka, E., Kubicki, G., McKeon, K.A.: Chromatic sums for colorings avoiding monochromatic subgraphs. Electron. Notes Discret. Math. 43, 247\u2013254 (2013)","journal-title":"Electron. Notes Discret. Math."},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"541","DOI":"10.7151\/dmgt.1819","volume":"43","author":"E Kubicka","year":"2015","unstructured":"Kubicka, E., Kubicki, G., McKeon, K.A.: Chromatic sums for colorings avoiding monochromatic subgraphs. Discuss. Math. Graph Theory 43, 541\u2013555 (2015)","journal-title":"Discuss. Math. Graph Theory"},{"issue":"Supplement C","key":"19_CR4","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.tcs.2016.10.011","volume":"659","author":"M Karpi\u0144ski","year":"2017","unstructured":"Karpi\u0144ski, M.: Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete. Theor. Comput. Sci. 659(Supplement C), 88\u201394 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.tcs.2016.11.011","volume":"659","author":"M Xiao","year":"2017","unstructured":"Xiao, M., Nagamochi, H.: Complexity and kernels for bipartition into degree-bounded induced graphs. Theor. Comput. Sci. 659, 72\u201382 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"19_CR6","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/jgt.3190100207","volume":"10","author":"LJ Cowen","year":"1986","unstructured":"Cowen, L.J., Cowen, R.H., Woodall, D.R.: Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valency. J. Graph Theory 10(2), 187\u2013195 (1986)","journal-title":"J. Graph Theory"},{"issue":"3","key":"19_CR7","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/j.tcs.2006.01.024","volume":"355","author":"C Bazgan","year":"2006","unstructured":"Bazgan, C., Tuza, Z., Vanderpooten, D.: Degree-constrained decompositions of graphs: bounded treewidth and planarity. Theor. Comput. Sci. 355(3), 389\u2013395 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR8","first-page":"1","volume":"1","author":"Y Wu","year":"1996","unstructured":"Wu, Y., Yuan, J., Zhao, Y.: Partition a graph into two induced forests. J. Math. Study 1, 1\u20136 (1996)","journal-title":"J. Math. Study"},{"key":"19_CR9","doi-asserted-by":"crossref","first-page":"46","DOI":"10.37236\/1799","volume":"11","author":"A Farrugia","year":"2004","unstructured":"Farrugia, A.: Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard. Electron. J. Comb. 11, 46 (2004)","journal-title":"Electron. J. Comb."},{"issue":"1","key":"19_CR10","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.tcs.2007.03.043","volume":"377","author":"M Rao","year":"2007","unstructured":"Rao, M.: MSOL partitioning problems on graphs of bounded treewidth and clique-width. Theor. Comput. Sci. 377(1), 260\u2013267 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"19_CR11","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990)","journal-title":"Inf. Comput."},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1051\/ita\/1992260302571","volume":"26","author":"B Courcelle","year":"1992","unstructured":"Courcelle, B.: The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues. Theor. Inform. Appl. 26, 257\u2013286 (1992)","journal-title":"Theor. Inform. Appl."},{"key":"19_CR13","volume-title":"Graph Theory","author":"R Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory. Springer, Heidelberg (2005)"},{"key":"19_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"issue":"2","key":"19_CR15","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","volume":"52","author":"N Robertson","year":"1991","unstructured":"Robertson, N., Seymour, P.: Graph minors. X. Obstructions to tree-decomposition. J. Comb. Theory Ser. B 52(2), 153\u2013190 (1991)","journal-title":"J. Comb. Theory Ser. B"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth: Computations and Approximations","year":"1994","unstructured":"Kloks, T. (ed.): Treewidth: Computations and Approximations. LNCS. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/BFb0045375"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-11509-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:20:55Z","timestamp":1710264055000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-11509-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030115081","9783030115098"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-11509-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"19 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kharagpur","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 February 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 February 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cse.iitkgp.ac.in\/conf\/CALDAM\/","order":11,"name":"conference_url","label":"Conference URL","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","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86","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":"22","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":"3","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":"26% - 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":"9","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)"}}]}}