{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:12Z","timestamp":1759639092510,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319559100"},{"type":"electronic","value":"9783319559117"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-55911-7_34","type":"book-chapter","created":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T10:23:37Z","timestamp":1490005417000},"page":"470-483","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions"],"prefix":"10.1007","author":[{"given":"Dani\u00ebl","family":"Paulusma","sequence":"first","affiliation":[]},{"given":"Christophe","family":"Picouleau","sequence":"additional","affiliation":[]},{"given":"Bernard","family":"Ries","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,21]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s00373-013-1380-2","volume":"31","author":"C Bazgan","year":"2015","unstructured":"Bazgan, C., Bentz, C., Picouleau, C., Ries, B.: Blockers for the stability number and the chromatic number. Graphs Comb. 31, 73\u201390 (2015)","journal-title":"Graphs Comb."},{"key":"34_CR2","doi-asserted-by":"crossref","first-page":"1933","DOI":"10.1016\/j.dam.2011.06.023","volume":"159","author":"C Bazgan","year":"2011","unstructured":"Bazgan, C., Toubaline, S., Tuza, Z.: The most vital nodes with respect to independent set and vertex cover. Discrete Appl. Math. 159, 1933\u20131946 (2011)","journal-title":"Discrete Appl. Math."},{"key":"34_CR3","unstructured":"Bentz, C., Costa, M.-C., de Werra, D., Picouleau, C., Ries, B.: Weighted transversals and blockers for some optimization problems in graphs. In: Progress in Combinatorial Optimization, Wiley-ISTE (2012)"},{"key":"34_CR4","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0166-218X(01)00327-4","volume":"124","author":"E Boros","year":"2002","unstructured":"Boros, E., Golumbic, M.C., Levit, V.E.: On the number of vertices belonging to all maximum stable sets of a graph. Discrete Appl. Math. 124, 17\u201325 (2002)","journal-title":"Discrete Appl. Math."},{"key":"34_CR5","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1007\/s10878-010-9334-6","volume":"22","author":"M-C Costa","year":"2011","unstructured":"Costa, M.-C., de Werra, D., Picouleau, C.: Minimum \n            $$d$$\n          -blockers and \n            $$d$$\n          -transversals in graphs. J. Comb. Optim. 22, 857\u2013872 (2011)","journal-title":"J. Comb. Optim."},{"key":"34_CR6","volume-title":"Graph Theory","author":"R Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory. Springer, Heidelberg (2005)"},{"key":"34_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-319-18173-8_14","volume-title":"Algorithms and Complexity","author":"\u00d6Y Diner","year":"2015","unstructured":"Diner, \u00d6.Y., Paulusma, D., Picouleau, C., Ries, B.: Contraction blockers for graphs with forbidden induced paths. In: Paschos, V.T., Widmayer, P. (eds.) CIAC 2015. LNCS, vol. 9079, pp. 194\u2013207. Springer, Cham (2015). doi:\n10.1007\/978-3-319-18173-8_14"},{"key":"34_CR8","unstructured":"F\u00f6ldes, S., Hammer, P.L.: Split graphs. In: 8th South-Eastern Conference on Combinatorics, Graph Theory and Computing, Congressus Numerantium, vol. 19, pp. 311\u2013315 (1977)"},{"key":"34_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-319-12340-0_17","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"PA Golovach","year":"2014","unstructured":"Golovach, P.A., Heggernes, P., Hof, P.V., Paul, C.: Hadwiger number of graphs with small chordality. In: Kratsch, D., Todinca, I. (eds.) WG 2014. LNCS, vol. 8747, pp. 201\u2013213. Springer, Cham (2014). doi:\n10.1007\/978-3-319-12340-0_17"},{"key":"34_CR10","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1137\/0603052","volume":"3","author":"PL Hammer","year":"1982","unstructured":"Hammer, P.L., Hansen, P., Simeone, B.: Vertices belonging to all or to no maximum stable sets of a graph. SIAM J. Algebraic Discrete Methods 3, 511\u2013522 (1982)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"34_CR11","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0166-218X(01)00183-4","volume":"117","author":"VE Levit","year":"2002","unstructured":"Levit, V.E., Mandrescu, E.: Combinatorial properties of the family of maximum stable sets of a graph. Discrete Appl. Math. 117, 149\u2013161 (2002)","journal-title":"Discrete Appl. Math."},{"key":"34_CR12","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1137\/110823560","volume":"26","author":"VE Levit","year":"2012","unstructured":"Levit, V.E., Mandrescu, E.: Vertices belonging to all critical sets of a graph. SIAM J. Discrete Math. 26, 399\u2013403 (2012)","journal-title":"SIAM J. Discrete Math."},{"key":"34_CR13","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1002\/net.21556","volume":"64","author":"FM Pajouh","year":"2014","unstructured":"Pajouh, F.M., Boginski, V., Pasiliao, E.L.: Minimum vertex blocker clique problem. Networks 64, 48\u201364 (2014)","journal-title":"Networks"},{"key":"34_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-319-45587-7_4","volume-title":"Combinatorial Optimization","author":"D Paulusma","year":"2016","unstructured":"Paulusma, D., Picouleau, C., Ries, B.: Reducing the clique and chromatic number via edge contractions and vertex deletions. In: Cerulli, R., Fujishige, S., Mahjoub, A.R. (eds.) ISCO 2016. LNCS, vol. 9849, pp. 38\u201349. Springer, Cham (2016). doi:\n10.1007\/978-3-319-45587-7_4"},{"key":"34_CR15","first-page":"307","volume":"15","author":"S Poljak","year":"1974","unstructured":"Poljak, S.: A note on the stable sets and coloring of graphs. Comment. Math. Univ. Carol. 15, 307\u2013309 (1974)","journal-title":"Comment. Math. Univ. Carol."},{"key":"34_CR16","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/j.disc.2009.08.009","volume":"310","author":"B Ries","year":"2010","unstructured":"Ries, B., Bentz, C., Picouleau, C., de Werra, D., Costa, M.-C., Zenklusen, R.: Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid. Discrete Math. 310, 132\u2013146 (2010)","journal-title":"Discrete Math."},{"key":"34_CR17","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/0020-0190(80)90140-4","volume":"10","author":"C Savage","year":"1980","unstructured":"Savage, C.: Maximum matchings and trees. Inf. Process. Lett. 10, 202\u2013205 (1980)","journal-title":"Inf. Process. Lett."},{"key":"34_CR18","unstructured":"Toubaline, S.: D\u00e9termination des \u00e9l\u00e9ments les plus vitaux pour des probl\u00e8mes de graphes, Ph. D thesis, Universit\u00e9 Paris-Dauphine (2010)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-55911-7_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,22]],"date-time":"2017-11-22T04:14:44Z","timestamp":1511324084000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-55911-7_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319559100","9783319559117"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55911-7_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}