{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T17:07:08Z","timestamp":1648832828117},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1993,6]]},"DOI":"10.1007\/bf01303204","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T09:04:23Z","timestamp":1111741463000},"page":"199-208","source":"Crossref","is-referenced-by-count":4,"title":["Preperfect graphs"],"prefix":"10.1007","volume":"13","author":[{"given":"Peter L.","family":"Hammer","sequence":"first","affiliation":[]},{"given":"Fr\ufffdd\ufffdric","family":"Maffray","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","first-page":"114","volume":"10","author":"C. Berge","year":"1961","unstructured":"C. Berge: F\u00e4rbung von Graphen, deren s\u00e4mtliche bzw. deren ungerade Kreise starr sind (Zusammenfassung)Wiss. Z. Natrin Luther Univ. Math.-Natur. Reihe 10 (1961), 114?115.","journal-title":"Wiss. Z. Natrin Luther Univ. Math.-Natur. Reihe"},{"key":"CR2","volume-title":"Graphs","author":"C. Berge","year":"1985","unstructured":"C. Berge:Graphs, North Holland, Amsterdam, New York, 1985."},{"key":"CR3","volume-title":"Topics on perfect graphs","year":"1984","unstructured":"C. Berge, andV. Chv\u00e1tal (editors),Topics on perfect graphs. North Holland, Amsterdam, 1984."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0304-0208(08)72922-0","volume-title":"Topics on perfect graphs","author":"C. Berge","year":"1984","unstructured":"C. Berge, andP. Duchet: Strongly perfect graphs. In:Topics on perfect graphs, C. Berge and V. Chv\u00e1tal, editors, 57?61. North Holland, Amsterdam, 1984."},{"key":"CR5","series-title":"Ann. Discrete Math. {nu21}","volume-title":"Topics on perfect graphs","author":"M. Burlet","year":"1984","unstructured":"M. Burlet, andJ. P. Uhry: Parity graphs. In:Topics on perfect graphs, C. Berge and V. Chv\u00e1tal, editors,Ann. Discrete Math. 21, North Holland, Amsterdam, 1984."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R. P. Dilworth","year":"1950","unstructured":"R. P. Dilworth: A decomposition theorem for partially irdered sets.Annals of Math. 51 (1950), 161?166.","journal-title":"Annals of Math."},{"key":"CR7","first-page":"3","volume":"7","author":"T. Gallai","year":"1962","unstructured":"T. Gallai: Graphen mit triangulierbaren ungeraden Vielecken.Magyar Tud. Akad. Kutat\u00f3 Int. K\u00f6zl. 7 (1962), 3?36.","journal-title":"Magyar Tud. Akad. Kutat\u00f3 Int. K\u00f6zl."},{"key":"CR8","volume-title":"Algorithmic graph theorey and perfect graphs","author":"M. C. Golumbic","year":"1980","unstructured":"M. C. Golumbic:Algorithmic graph theorey and perfect graphs, Academic Press, New York, 1980."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"720","DOI":"10.4153\/CJM-1965-072-1","volume":"17","author":"A. Hajnal","year":"1965","unstructured":"A. Hajnal: A theorem onk-saturated graphs.Cancadian J. of Math.,17 (1965), 720?724.","journal-title":"Cancadian J. of Math."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF01788689","volume":"5","author":"R. Hayward","year":"1989","unstructured":"R. Hayward, C. T. Ho\u00e0ng, andF. Maffray: Optimizing weakly triangulated graphs.Graphs and Combinatorics 5 (1989), 339?349.","journal-title":"Graphs and Combinatorics"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01788660","volume":"5","author":"C. T. Ho\u00e0ng","year":"1989","unstructured":"C. T. Ho\u00e0ng, andF. Maffray: Opposition graphs are quasi-parity graphs.Graphs and Combinatorics 5 (1989), 83?85.","journal-title":"Graphs and Combinatorics"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0095-8956(72)90045-7","volume":"13","author":"L. Lov\u00e1sz","year":"1972","unstructured":"L. Lov\u00e1sz: A characterization of perfect graphs.J. Comb. Theory B 13 (1972), 95?98.","journal-title":"J. Comb. Theory B"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","volume":"2","author":"L. Lov\u00e1sz","year":"1972","unstructured":"L. Lov\u00e1sz: Normal hypergraphs and the perfect graph conjecture.Discrete Math 2 (1972), 253?267.","journal-title":"Discrete Math"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0195-6698(87)80037-9","volume":"8","author":"H. Meyniel","year":"1987","unstructured":"H. Meyniel: A new property of critical imperfect graphs and some consequences.European J. of Combinatorics 8 (1987), 313?316.","journal-title":"European J. of Combinatorics"},{"key":"CR15","first-page":"115","volume":"15","author":"E. Olaru","year":"1969","unstructured":"E. Olaru: \u00dcber die \u00dcberdeckung von Graphen mit Cliquen.Wiss. Z. Tech. Hochsch. Ilmenau 15 (1969), 115?121.","journal-title":"Wiss. Z. Tech. Hochsch. Ilmenau"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0304-0208(08)72932-3","volume-title":"Topics on perfect graphs","author":"M. W. Padberg","year":"1984","unstructured":"M. W. Padberg: A characterization of perfect matrices. In C. Berge and V. Chv\u00e1tal, editors,Topics on perfect graphs, 169?178. North Holland, Amsterdam, 1984."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01303204.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01303204\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01303204","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T14:08:44Z","timestamp":1556633324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01303204"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["BF01303204"],"URL":"https:\/\/doi.org\/10.1007\/bf01303204","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}