{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:02:41Z","timestamp":1725552161624},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310006"},{"type":"electronic","value":"9783540314684"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11604686_15","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:02:01Z","timestamp":1133794921000},"page":"163-174","source":"Crossref","is-referenced-by-count":0,"title":["On Stable Cutsets in Claw-Free Graphs and Planar Graphs"],"prefix":"10.1007","author":[{"given":"Van Bang","family":"Le","sequence":"first","affiliation":[]},{"given":"Raffaele","family":"Mosca","sequence":"additional","affiliation":[]},{"given":"Haiko","family":"M\u00fcller","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-540-39890-5_9","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"P. Bonsma","year":"2003","unstructured":"Bonsma, P.: The complexity of the matching-cut problem for planar graphs and other graph classes. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 93\u2013105. Springer, Heidelberg (2003)"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0166-218X(00)00197-9","volume":"105","author":"A. Brandst\u00e4dt","year":"2000","unstructured":"Brandst\u00e4dt, A., Dragan, F., Le, V.B., Szymczak, T.: On stable cutsets in graphs. Discr. Appl. Math.\u00a0105, 39\u201350 (2000)","journal-title":"Discr. Appl. Math."},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1002\/jgt.10074","volume":"41","author":"G. Chen","year":"2002","unstructured":"Chen, G., Faudree, R.J., Jacobson, M.S.: Fragile graphs with small independent cuts. J.\u00a0Graph Theory\u00a041, 327\u2013341 (2002)","journal-title":"J.\u00a0Graph Theory"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0012-365X(01)00226-6","volume":"249","author":"G. Chen","year":"2002","unstructured":"Chen, G., Yu, X.: A note on fragile graphs. Discrete Math.\u00a0249, 41\u201343 (2002)","journal-title":"Discrete Math."},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/jgt.3190080106","volume":"8","author":"V. Chv\u00e1tal","year":"1984","unstructured":"Chv\u00e1tal, V.: Recognizing decomposable Graphs. J.\u00a0Graph Theory\u00a08, 51\u201353 (1984)","journal-title":"J.\u00a0Graph Theory"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jctb.1993.1049","volume":"59","author":"D.G. Corneil","year":"1993","unstructured":"Corneil, D.G., Fonlupt, J.: Stable set bonding in perfect graphs and parity graphs. J.\u00a0Combin. Theory (B)\u00a059, 1\u201314 (1993)","journal-title":"J.\u00a0Combin. Theory (B)"},{"key":"15_CR7","doi-asserted-by":"crossref","first-page":"105","DOI":"10.7155\/jgaa.00027","volume":"1","author":"G. Battista di","year":"2000","unstructured":"di Battista, G., Patrignani, M., Vargiu, F.: A Split&Push approach to 3D orthogonal drawing. J.\u00a0Graph Algorithms Appl.\u00a01, 105\u2013133 (2000)","journal-title":"J.\u00a0Graph Algorithms Appl."},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/net.3230120404","volume":"12","author":"A.M. Farley","year":"1982","unstructured":"Farley, A.M., Proskurowski, A.: Networks immune to isolated line failures. Networks\u00a012, 393\u2013403 (1982)","journal-title":"Networks"},{"key":"15_CR9","first-page":"153","volume":"41","author":"A.M. Farley","year":"1984","unstructured":"Farley, A.M., Proskurowski, A.: Extremal graphs with no disconnecting matching. Congressus Nummerantium\u00a041, 153\u2013165 (1984)","journal-title":"Congressus Nummerantium"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1137\/S0895480100384055","volume":"16","author":"T. Feder","year":"2003","unstructured":"Feder, T., Hell, P., Klein, S., Motwani, R.: List partitions. SIAM J.\u00a0Discrete Math.\u00a016, 449\u2013478 (2003)","journal-title":"SIAM J.\u00a0Discrete Math."},{"key":"15_CR11","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1111\/j.1749-6632.1970.tb56468.x","volume":"175","author":"R.L. Graham","year":"1970","unstructured":"Graham, R.L.: On primitive graphs and optimal vertex assigments. Ann. N.Y. Acad. Sci.\u00a0175, 170\u2013186 (1970)","journal-title":"Ann. N.Y. Acad. Sci."},{"key":"15_CR12","first-page":"271","volume-title":"Selected Topics in Graph Theory I","author":"R.L. Hemminger","year":"1978","unstructured":"Hemminger, R.L., Beineke, L.W.: Line graphs and line digraphs. In: Beineke, L.W., Wilson, R.T. (eds.) Selected Topics in Graph Theory I, pp. 271\u2013305. Academic Press, London (1978)"},{"key":"15_CR13","first-page":"217","volume":"119","author":"S. Klein","year":"1996","unstructured":"Klein, S., de Figueiredo, C.M.H.: The NP-completeness of multi-partite cutset testing. Congressus Numerantium\u00a0119, 217\u2013222 (1996)","journal-title":"Congressus Numerantium"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1137\/0211025","volume":"11","author":"D. Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIAM Journal on Computing\u00a011, 320\u2013343 (1982)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/S0304-3975(03)00048-3","volume":"301","author":"V.B. Le","year":"2003","unstructured":"Le, V.B., Randerath, B.: On stable cutsets in line graphs. Theor. Comput. Sci.\u00a0301, 463\u2013475 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1002\/jgt.3190130502","volume":"13","author":"A.M. Moshi","year":"1989","unstructured":"Moshi, A.M.: Matching cutsets in graphs. J.\u00a0Graph Theory\u00a013, 527\u2013536 (1989)","journal-title":"J.\u00a0Graph Theory"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/3-540-45477-2_26","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Patrignani","year":"2001","unstructured":"Patrignani, M., Pizzonia, M.: The complexity of the matching-cut problem. In: Brandst\u00e4dt, A., Le, V.B. (eds.) WG 2001. LNCS, vol.\u00a02204, pp. 284\u2013295. Springer, Heidelberg (2001)"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0012-365X(85)90051-2","volume":"55","author":"R.E. Tarjan","year":"1985","unstructured":"Tarjan, R.E.: Decomposition by clique separators. Discr. Math.\u00a055, 221\u2013232 (1985)","journal-title":"Discr. Math."},{"key":"15_CR19","volume-title":"Graph drawing. Algorithms for the visualization of graphs","author":"I. Tollis","year":"1999","unstructured":"Tollis, I., di Battista, G., Eades, P., Tamassia, R.: Graph drawing. Algorithms for the visualization of graphs. Prentice Hall, Upper Saddle River (1999)"},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/0095-8956(83)90039-4","volume":"34","author":"A. Tucker","year":"1983","unstructured":"Tucker, A.: Coloring graphs with stable cutsets. J.\u00a0Combin. Theory (B)\u00a034, 258\u2013267 (1983)","journal-title":"J.\u00a0Combin. Theory (B)"},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0020-0190(81)90072-7","volume":"12","author":"S.H. Whitesides","year":"1981","unstructured":"Whitesides, S.H.: An algorithm for finding clique cut-sets. Inf. Process. Lett.\u00a012, 31\u201332 (1981)","journal-title":"Inf. Process. Lett."},{"key":"15_CR22","first-page":"281","volume":"21","author":"S.H. Whitesides","year":"1984","unstructured":"Whitesides, S.H.: An method for solving certain graph recognition and optimization problems, with applications to perfect graphs. Ann. Discr. Math.\u00a021, 281\u2013297 (1984)","journal-title":"Ann. Discr. Math."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11604686_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:18Z","timestamp":1619507058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11604686_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540310006","9783540314684"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11604686_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}