{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,3]],"date-time":"2023-02-03T05:50:26Z","timestamp":1675403426990},"reference-count":3,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"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":[[1990,3]]},"DOI":"10.1007\/bf01787477","type":"journal-article","created":{"date-parts":[[2005,6,19]],"date-time":"2005-06-19T18:43:43Z","timestamp":1119206623000},"page":"33-35","source":"Crossref","is-referenced-by-count":12,"title":["Optimizing weakly triangulated graphs"],"prefix":"10.1007","volume":"6","author":[{"given":"Ryan","family":"Hayward","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ch\u00ednh T.","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":"BF01787477_CR1","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF01788689","volume":"5","author":"R. Hayward","year":"1989","unstructured":"Hayward, R., Ho\u00e0ng C.T., Maffray, F.: Optimizing weakly triangulated graphs. Graphs and Combinatorics5, 339\u2013349 (1989)","journal-title":"Graphs and Combinatorics"},{"key":"BF01787477_CR2","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":"BF01787477_CR3","unstructured":"Ho\u00e0ng, C.T., Maffray, F.: Weakly triangulated graphs are strict quasi-parity graphs. RUTCOR Research Rpt., Rutgers University 6\u201386 (1986)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01787477.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01787477\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01787477","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T13:12:17Z","timestamp":1557493937000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01787477"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":3,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["BF01787477"],"URL":"https:\/\/doi.org\/10.1007\/bf01787477","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}