{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T12:21:50Z","timestamp":1648729310084},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"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":["Graphs and Combinatorics"],"published-print":{"date-parts":[[1997,12]]},"DOI":"10.1007\/bf03353015","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T03:47:53Z","timestamp":1403581673000},"page":"369-395","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Chair-Free Berge Graphs Are Perfect"],"prefix":"10.1007","volume":"13","author":[{"given":"Antonio","family":"Sassano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,6,17]]},"reference":[{"key":"BF03353015_CR1","unstructured":"Berge, C.: F\u00e4rbung von Graphen, deren s\u00e4mlitche bzw, ungerade Kreise starr sind (Zusammenfassung), Wiss, Z. Mar-tin Luther Univ. Halle Wittenberg, Math. Nat. Reihe (1961) 114."},{"key":"BF03353015_CR2","doi-asserted-by":"crossref","unstructured":"Berge, C., Chv\u00e1tal, V. Eds.: Topics on Perfect Graphs. Annals of Discrete Mathematics, Vol 21 Amsterdam: North Holland 1984","DOI":"10.1016\/S0304-0208(08)72921-9"},{"key":"BF03353015_CR3","doi-asserted-by":"crossref","unstructured":"Conforti, M., Cornu\u00e9jols, G., Kapoor, A., Vu\u0161kovi\u0107, K.: A Mickey Mouse Decomposition Theorem, Proceedings IPCO IV, Copenhagen, (May 1995)","DOI":"10.1007\/3-540-59408-6_61"},{"key":"BF03353015_CR4","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","volume":"B18","author":"V Chv\u00e1tal","year":"1975","unstructured":"Chv\u00e1tal, V.: On certain polytopes associated with graphs. J. Comb. Theory ser. B 18, 138\u2013154 (1975)","journal-title":"J. Comb. Theory ser"},{"key":"BF03353015_CR5","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0095-8956(85)90049-8","volume":"B39","author":"V Chv\u00e1tal","year":"1985","unstructured":"Chv\u00e1tal, V.: Star cutsets and perfect graphs. J. Comb. Theory ser. B 39, 189\u2013299 (1985)","journal-title":"J. Comb. Theory ser"},{"key":"BF03353015_CR6","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01788536","volume":"3","author":"V Chv\u00e1tal","year":"1987","unstructured":"Chv\u00e1tal, V., Sbihi, N.: Bull-free Berge graphs are perfect. Graphs and Comb. 3, 127\u2013139 (1987)","journal-title":"Graphs and Comb"},{"key":"BF03353015_CR7","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0012-365X(94)90373-5","volume":"131","author":"C Simone De","year":"1994","unstructured":"De Simone, C., Galluccio, A.: New classes of Berge perfect graphs. Discrete Math. 131, 67\u201379 (1994)","journal-title":"Discrete Math"},{"key":"BF03353015_CR8","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0166-218X(93)90032-J","volume":"41","author":"C Simone De","year":"1993","unstructured":"De Simone, C., Sassano, A.: Stability Number of Bull and Chair Free Graphs. Discrete Appl. Math. 41, 121\u2013129 (1993)","journal-title":"Discrete Appl. Math"},{"key":"BF03353015_CR9","doi-asserted-by":"crossref","unstructured":"Galluccio, A., Sassano, A.: The rank facets of the stable set polytope for claw-free graphs. Technical Report n. 340, IASI-CNR, Rome (1994) J. Comb. Theory ser. B (1997) (to be published)","DOI":"10.1006\/jctb.1996.1715"},{"key":"BF03353015_CR10","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","volume":"2","author":"L Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz, L.: Normal Hypergraphs and the perfect graph conjecture. Discrete Math. 2, 253\u2013267 (1972)","journal-title":"Discrete Math"},{"key":"BF03353015_CR11","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0095-8956(72)90045-7","volume":"B13","author":"L Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz, L.: A Characterization of Perfect Graphs, J. Comb. Theory ser. B 13, 95\u201398 (1972)","journal-title":"J. Comb. Theory ser"},{"key":"BF03353015_CR12","volume-title":"Matching Theory. Annals of Discrete Mathematics, Vol 29","author":"L Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz, L., Plummer, M.: Matching Theory. Annals of Discrete Mathematics, Vol 29 Amsterdam: North Holland 1986"},{"key":"BF03353015_CR13","unstructured":"Mannino, C., Sassano, A.: Edge Projection and the Maximum Cardinality Stable Set Problem. In: D.S. Johnson, M.A. Trick: Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge. DIMACS Series in Discrete Mathematics and Theoretical Computer Science (to be published)"},{"key":"BF03353015_CR14","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1002\/jgt.3190120206","volume":"12","author":"S Olariu","year":"1988","unstructured":"Olariu, S.: On the strong perfect graph conjecture. J. Graph Theory 12, 169\u2013176 (1988)","journal-title":"J. Graph Theory"},{"key":"BF03353015_CR15","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0020-0190(88)90143-3","volume":"28","author":"S Olariu","year":"1988","unstructured":"Olariu, S.: Paw-free graphs. Information Processing Letters 28, 53\u201354 (1988)","journal-title":"Information Processing Letters"},{"key":"BF03353015_CR16","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0095-8956(89)90019-1","volume":"B47","author":"S Olariu","year":"1989","unstructured":"Olariu, S.: The Strong Perfect Graph Conjecture for Pan-free graphs, J. Comb. Theory ser. B 47, 187\u2013191 (1989)","journal-title":"J. Comb. Theory ser"},{"key":"BF03353015_CR17","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/BF01580235","volume":"6","author":"MW Padberg","year":"1974","unstructured":"Padberg, M.W.: Perfect zero-one Matrices. Mathematical Programming, 6, 180\u2013196 (1974)","journal-title":"Mathematical Programming"},{"key":"BF03353015_CR18","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/S0095-8956(76)80005-6","volume":"B21","author":"KR Parthasarathy","year":"1976","unstructured":"Parthasarathy, K.R., Ravindra, G.: The strong perfect graph conjecture is true for (K 1, 3)-free graphs. J. Comb. Theory ser. B 21 212\u2013223 (1976)","journal-title":"J. Comb. Theory ser"},{"key":"BF03353015_CR19","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/0095-8956(79)90047-9","volume":"B26","author":"KR Parthasarathy","year":"1979","unstructured":"Parthasarathy, K.R., Ravindra, G.: The validity of the strong perfect graph conjecture for (K 4 \u2212 e)-free graphs. J. Comb. Theory ser. B 26, 98\u2013100 (1979)","journal-title":"J. Comb. Theory ser"},{"key":"BF03353015_CR20","unstructured":"Sassano, A.: Reducible cliques and the Strong Perfect Graph Conjecture, IASI Technical Report R.257, (March 1989)"},{"key":"BF03353015_CR21","unstructured":"Seb\u0151, A.: On critical edges in minimal imperfect graphs. Proceedings IPCO III, Erice (May 1993)."},{"key":"BF03353015_CR22","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0095-8956(74)90063-X","volume":"B16","author":"D Seinsche","year":"1974","unstructured":"Seinsche, D.: On a property of the class of n-colorable graphs. J. Comb. Theory ser. B 16, 191\u2013193 (1974)","journal-title":"J. Comb. Theory ser"},{"key":"BF03353015_CR23","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0095-8956(91)90078-X","volume":"B53","author":"L Sun","year":"1991","unstructured":"Sun, Liping: Two classes of perfect graphs. J. Comb. Theory ser. B 53, 273\u2013292 (1991)","journal-title":"J. Comb. Theory ser"},{"key":"BF03353015_CR24","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0095-8956(87)90048-7","volume":"B42","author":"A Tucker","year":"1987","unstructured":"Tucker, A.: Coloring perfect (K 4 \u2212 e)-free graphs. J. Comb. Theory ser. B 42, 313\u2013318 (1987).","journal-title":"J. Comb. Theory ser"},{"key":"BF03353015_CR25","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0095-8956(77)90064-8","volume":"B23","author":"A Tucker","year":"1977","unstructured":"Tucker, A.: Critical perfect graphs and perfect 3-chromatic graphs. J. Comb. Theory ser. B 23, 143\u2013149 (1977)","journal-title":"J. Comb. Theory ser"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03353015.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03353015\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03353015","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T17:19:55Z","timestamp":1565543995000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03353015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1997,12]]}},"alternative-id":["BF03353015"],"URL":"https:\/\/doi.org\/10.1007\/bf03353015","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,12]]}}}