{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T04:54:25Z","timestamp":1776401665311,"version":"3.51.2"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1989,12,1]],"date-time":"1989-12-01T00:00:00Z","timestamp":628473600000},"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":[[1989,12]]},"DOI":"10.1007\/bf01788689","type":"journal-article","created":{"date-parts":[[2005,6,19]],"date-time":"2005-06-19T18:46:51Z","timestamp":1119206811000},"page":"339-349","source":"Crossref","is-referenced-by-count":80,"title":["Optimizing weakly triangulated graphs"],"prefix":"10.1007","volume":"5","author":[{"given":"Ryan","family":"Hayward","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ch\u00ednh","family":"Ho\u00e0ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Maffray","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01788689_CR1","unstructured":"Berge, C.: F\u00e4rbung von Graphen deren s\u00e4mtliche bzw. ungerade Kreise starr sind (Zusammenfassung). Wiss. Z. Martin-Luther-Univ. Halle-Winterberg, Math.-Natur. Reihe, 114 (1961)"},{"key":"BF01788689_CR2","doi-asserted-by":"crossref","unstructured":"Berge, C. Chv\u00e1tal, V.:Topics on perfect graphs, Ann. Discrete Math.21, (1984)","DOI":"10.1016\/S0304-0208(08)72921-9"},{"key":"BF01788689_CR3","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedure. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, Assoc. Comp. Mach., New York, 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"key":"BF01788689_CR4","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L. Schrijver, A.: Polynomial algorithms for perfect graphs. In: [2, pp. 325\u2013356]"},{"key":"BF01788689_CR5","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0095-8956(85)90050-4","volume":"39","author":"R. Hayward","year":"1985","unstructured":"Hayward, R.: Weakly triangulated graphs. J. Comb. Theory (B)39, 200\u2013208 (1985)","journal-title":"J. Comb. Theory (B)"},{"key":"BF01788689_CR6","unstructured":"Hayward, R.: Two classes of perfect graphs. Doctoral thesis, School of Computer Science, McGill University (1987)"},{"key":"BF01788689_CR7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. Karp","year":"1972","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Complexity of Computer Computations (by R. Miller and J. Thatcher) pp. 85\u2013103 New York: Plenum Press (1972)"},{"key":"BF01788689_CR8","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0195-6698(87)80037-9","volume":"8","author":"H. Meyniel","year":"1987","unstructured":"Meyniel, H.: A new property of critical imperfect graphs and some consequences. Europ. J. Comb.8, 313\u2013316 (1987)","journal-title":"Europ. J. Comb."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01788689.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01788689\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01788689","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T21:03:29Z","timestamp":1586293409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01788689"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["BF01788689"],"URL":"https:\/\/doi.org\/10.1007\/bf01788689","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,12]]}}}