{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T22:36:30Z","timestamp":1791153390719,"version":"4.1.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,12,7]],"date-time":"2013-12-07T00:00:00Z","timestamp":1386374400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s00373-013-1380-2","type":"journal-article","created":{"date-parts":[[2013,12,6]],"date-time":"2013-12-06T10:36:30Z","timestamp":1386326190000},"page":"73-90","source":"Crossref","is-referenced-by-count":19,"title":["Blockers for the Stability Number and the Chromatic Number"],"prefix":"10.1007","volume":"31","author":[{"given":"C.","family":"Bazgan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C.","family":"Bentz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C.","family":"Picouleau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"B.","family":"Ries","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,12,7]]},"reference":[{"key":"1380_CR1","doi-asserted-by":"crossref","unstructured":"Asratian, A., Denley, T.M.J., H\u00e4ggkvist, R.: Bipartite Graphs and Their Applications. Cambridge University Press, Cambridge (1998)","DOI":"10.1017\/CBO9780511984068"},{"key":"1380_CR2","unstructured":"Bar-Noy, A., Khuller, S., Schieber, B.: The complexity of finding most vital arcs and nodes, Technical Report CS-TR-3539, University of Maryland (1995)"},{"issue":"17","key":"1380_CR3","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(17), 1933\u20131946 (2011)","journal-title":"Discrete Appl. Math."},{"key":"1380_CR4","doi-asserted-by":"crossref","unstructured":"Bazgan, C., Toubaline, S., Tuza, Z.: Complexity of the most vital nodes for independent set on tree structures. In: Proceedings of the 21 International Workshop on Combinatorial Algorithms (IWOCA 2010), LNCS vol. 6460, pp. 154\u2013166 (2010)","DOI":"10.1007\/978-3-642-19222-7_17"},{"issue":"2","key":"1380_CR5","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10878-012-9469-8","volume":"25","author":"C. Bazgan","year":"2013","unstructured":"Bazgan C., Toubaline S., Vanderpooten D.: Complexity of determining the most vital elements for the p-median and p-center location problems. J. Comb. Optim. 25(2), 191\u2013207 (2013)","journal-title":"J. Comb. Optim."},{"key":"1380_CR6","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/s10878-011-9449-4","volume":"26","author":"C. Bazgan","year":"2013","unstructured":"Bazgan C., Toubaline S., Vanderpooten D.: Critical edges\/nodes for the minimum spanning tree problem: complexity and approximation. J. Comb. Optim. 26, 178\u2013189 (2013)","journal-title":"J. Comb. Optim."},{"key":"1380_CR7","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.jda.2012.06.002","volume":"17","author":"C. Bentz","year":"2012","unstructured":"Bentz C., Costa M.-C., Picouleau C., Ries B., de Werra D.: d-Transversals of stable sets and vertex covers in weighted bipartite graphs. J. Discrete Algorithms 17, 95\u2013102 (2012)","journal-title":"J. Discrete Algorithms"},{"key":"1380_CR8","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"R.L. Brooks","year":"1941","unstructured":"Brooks R.L.: On colouring the nodes of a network. Proc. Camb. Philos. Soc. Math. Phys. Sci. 37, 194\u2013197 (1941)","journal-title":"Proc. Camb. Philos. Soc. Math. Phys. Sci."},{"key":"1380_CR9","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Crown reductions for the minimum weighted vertex cover problem. Discrete Appl. Math. 156(3), 292\u2013312 (2008)"},{"issue":"4","key":"1380_CR10","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 d-blockers and d-transversals in graphs. J. Comb. Optim. 22(4), 857\u2013872 (2011)","journal-title":"J. Comb. Optim."},{"issue":"1-3","key":"1380_CR11","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0012-365X(90)90348-L","volume":"86","author":"J.F. Fink","year":"1990","unstructured":"Fink J.F., Jacobson M.S., Kinch L.F., Roberts J.: The bondage number of a graph. Discrete Math. 86(1-3), 47\u201357 (1990)","journal-title":"Discrete Math."},{"key":"1380_CR12","unstructured":"Frederickson, G.N., Solis-Oba, R.: Increasing the weight of minimum spanning trees. In: Proceedings of the 7 ACM-SIAM Symposium on Discrete Algorithms (SODA 1996) pp. 539\u2013546"},{"key":"1380_CR13","volume-title":"Computers and tractability: a guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey M.R., Johnson D.S.: Computers and tractability: a guide to the theory of NP-completeness. Freeman, New York (1979)"},{"issue":"2","key":"1380_CR14","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1007\/s00224-007-9025-6","volume":"43","author":"L. Khachiyan","year":"2008","unstructured":"Khachiyan L., Boros E., Borys K., Elbassioni K., Gurvich V., Rudolf G., Zhao J.: On short paths interdiction problems: total and node-wise limited interdiction. Theory Comput. Syst. 43(2), 204\u2013233 (2008)","journal-title":"Theory Comput. Syst."},{"issue":"5","key":"1380_CR15","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1016\/j.orl.2006.12.004","volume":"35","author":"J. Monnot","year":"2007","unstructured":"Monnot J., Toulouse S.: The path partition problem and related problems in bipartite graphs. Oper. Res. Lett. 35(5), 677\u2013684 (2007)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"1380_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(1), 132\u2013146 (2010)","journal-title":"Discrete Math."},{"key":"1380_CR17","unstructured":"Toubaline, S.: (2010) D\u00e9termination des \u00e9l\u00e9ments les plus vitaux pour des probl\u00e8mes de graphes, PhD Thesis, Universit\u00e9 Paris-Dauphine"},{"key":"1380_CR18","first-page":"436","volume":"48","author":"P. Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n P.: On an extremal problem in graph theory (in Hungarian). Matematikai s Fizikai Lapok. 48, 436\u2013452 (1941)","journal-title":"Matematikai s Fizikai Lapok."},{"key":"1380_CR19","unstructured":"West, D.B.: (2001) Introduction to Graph Theory, 2nd Edn. Prentice Hall, Englewood Cliffs"},{"issue":"2","key":"1380_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0895-7177(93)90236-R","volume":"17","author":"R.K. Wood","year":"1993","unstructured":"Wood R.K.: Deterministic network interdiction. Math. Comput. Model. 17(2), 1\u201318 (1993)","journal-title":"Math. Comput. Model."},{"key":"1380_CR21","unstructured":"Zenklusen, R.: Matching Interdiction. Discrete Appl. Math. 158, 1676\u20131690 (2010)"},{"issue":"13","key":"1380_CR22","doi-asserted-by":"crossref","first-page":"4306","DOI":"10.1016\/j.disc.2009.01.006","volume":"309","author":"R. Zenklusen","year":"2009","unstructured":"Zenklusen R., Ries B., Picouleau C., de Werra D., Costa M.-C., Bentz C.: Blockers and transversals. Discrete Math. 309(13), 4306\u20134314 (2009)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1380-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-013-1380-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1380-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,4]],"date-time":"2019-08-04T15:19:21Z","timestamp":1564931961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-013-1380-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,7]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["1380"],"URL":"https:\/\/doi.org\/10.1007\/s00373-013-1380-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,7]]}}}