{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:10:49Z","timestamp":1725541849799},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114083"},{"type":"electronic","value":"9783642114090"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11409-0_29","type":"book-chapter","created":{"date-parts":[[2009,12,3]],"date-time":"2009-12-03T13:12:27Z","timestamp":1259845947000},"page":"329-340","source":"Crossref","is-referenced-by-count":0,"title":["Smallest Odd Holes in Claw-Free Graphs (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Shimon","family":"Shrem","sequence":"first","affiliation":[]},{"given":"Michal","family":"Stern","sequence":"additional","affiliation":[]},{"given":"Martin Charles","family":"Golumbic","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","unstructured":"Berge, C.: F\u00e4rbung von Graphen deren s\u00e4mtliche bzw. deren ungerade Kreise starr sind, Wiss. Zeitschrift, Mathematisch-Naturwissenschaftliche Reihe, Martin-Luther-Univ. Halle-Wittenberg, pp. 114\u2013115 (1961)"},{"key":"29_CR2","first-page":"164","volume":"7","author":"A. Berry","year":"2000","unstructured":"Berry, A., Bordat, J.P., Heggerens, P.: Recognizing weakly triangulated graphs by edge separability. Nordic J. Computing\u00a07, 164\u2013177 (2000)","journal-title":"Nordic J. Computing"},{"issue":"1","key":"29_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M. Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P.D., Thomas, R.: The strong perfect graph theorem. Ann. of Math.\u00a0164(1), 51\u2013229 (2006)","journal-title":"Ann. of Math."},{"issue":"2","key":"29_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s00493-005-0012-8","volume":"25","author":"M. Chudnovsky","year":"2005","unstructured":"Chudnovsky, M., Cornu\u00e9jols, G., Liu, X., Seymour, P., Vu\u0161kovi\u0107, K.: Recognizing Berge Graphs. Combinatorica\u00a025(2), 143\u2013186 (2005)","journal-title":"Combinatorica"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Chudnovsky, M., Seymour, P.D.: The structure of claw-free graphs. In: Surveys in Combinatorics. London Math Soc. Lecture Note Series, vol.\u00a0327 (2005)","DOI":"10.1017\/CBO9780511734885.008"},{"issue":"3","key":"29_CR6","first-page":"154","volume":"44","author":"V. Chv\u00e1tal","year":"1987","unstructured":"Chv\u00e1tal, V., Sbihi, N.: Recognizing claw-free perfect graphs. Journal of Combinatorial Theory Series A\u00a044(3), 154\u2013176 (1987)","journal-title":"Journal of Combinatorial Theory Series A"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Cornu\u00e9jols, G., Liu, X., Vu\u0161kovi\u0107, K.: A polynomial algorithm for recognizing perfect graphs. In: Proc. 44th IEEE Symp. on Foundations of Computer Science (FOCS 2003), pp. 20\u201327 (2003)","DOI":"10.1109\/SFCS.2003.1238177"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T. Gallai","year":"1967","unstructured":"Gallai, T.: Transitiv orientierbare Graphen. Acta Math. Acad Sci. Hungar.\u00a018, 25\u201366 (1967)","journal-title":"Acta Math. Acad Sci. Hungar."},{"key":"29_CR9","series-title":"Annals of Discrete Mathematics","volume-title":"Algorithmic graph theory and perfect graphs","author":"M.C. Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Annals of Discrete Mathematics, vol.\u00a057. Elsevier, Amsterdam (2004)"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/0095-8956(85)90050-4","volume":"39","author":"R.B. Hayward","year":"1985","unstructured":"Hayward, R.B.: Weakly triangulated graphs. J. Comb. Theory Ser. B\u00a039, 200\u2013208 (1985)","journal-title":"J. Comb. Theory Ser. B"},{"key":"29_CR11","unstructured":"Hayward, R.B.: Two classes of perfect graphs, PhD Thesis, School of Computer Science, McGill University (1987)"},{"key":"29_CR12","unstructured":"Hayward, R.B., Spinrad, J., Sritharan, R.: Weakly chordal graph algorithms via handles. In: Proc. 11th ACM-SIAM Symp. on Discrete Algorithms (SODA 2000), pp. 42\u201349 (2000)"},{"key":"29_CR13","unstructured":"Nikolopoulos, S.D., Palios, L.: Holes and antihole detection in graphs. In: Proc. 15th ACM-SIAM Sympos. Discrete Algorithms, pp. 843\u2013852 (2004)"},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D.J. Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Computing\u00a05, 266\u2013283 (1976)","journal-title":"SIAM J. Computing"},{"key":"29_CR15","unstructured":"Shrem, S.: Odd hole-free Graphs, M.Sc. thesis, Department of Computer Science, University of Haifa, February 27 (2006), http:\/\/digitool.haifa.ac.il\/R\/?func=dbin-jump-full&object_id=175621&local_base=GEN01"},{"key":"29_CR16","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0020-0190(91)90184-J","volume":"39","author":"J.P. Spinrad","year":"1991","unstructured":"Spinrad, J.P.: Finding large holes. Inform. Process. Letters\u00a039, 227\u2013229 (1991)","journal-title":"Inform. Process. Letters"},{"key":"29_CR17","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0166-218X(93)E0161-Q","volume":"59","author":"J.P. Spinrad","year":"1995","unstructured":"Spinrad, J.P., Sritharan, R.: Algorithms for weakly triangulated graphs. Discrete Applied Math.\u00a059, 181\u2013191 (1995)","journal-title":"Discrete Applied Math."},{"key":"29_CR18","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R.E. Tarjan","year":"1984","unstructured":"Tarjan, R.E., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Computing\u00a013, 566\u2013579 (1984)","journal-title":"SIAM J. Computing"}],"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\/978-3-642-11409-0_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:40:21Z","timestamp":1606185621000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11409-0_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114083","9783642114090"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11409-0_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}