{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T07:59:22Z","timestamp":1704355162680},"reference-count":5,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":8533,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1983,6]]},"DOI":"10.1002\/net.3230130214","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T15:17:41Z","timestamp":1178896661000},"page":"304-305","source":"Crossref","is-referenced-by-count":4,"title":["Algorithmic graph theory and perfect graphs, by Martin C. Golumbic, Academic, New York, 284 pp. Price: $34.00"],"prefix":"10.1002","volume":"13","author":[{"suffix":"Jr.","given":"Leslie E.","family":"Trotter","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"F. R.Giles L. E.Trotter Jr. andA.Tucker The Strong Perfect Graph Theorem for a class of partitionable graphs. InPerfect Graphs C. Berge and V. Chvatal Ed. To appear."},{"key":"e_1_2_1_3_2","article-title":"The ellipsoid method and its consequences in combinatorial optimization","author":"Grotschel M.","journal-title":"Combinatorica."},{"key":"e_1_2_1_4_2","unstructured":"W.\u2010L.Hsu Efficient algorithms for some packing and covering problems on graphs. Ph.D. Thesis Cornell University School of Operations Research and Industrial Engineering (1980)."},{"key":"e_1_2_1_5_2","unstructured":"E.Koch Ramifications of matching theory. Ph.D. Thesis University of Waterloo Department of Combinatorics and Optimization (1979)."},{"key":"e_1_2_1_6_2","unstructured":"K.Cameron Polyhedral and algorithmic ramifications of antichains. Ph.D. Thesis University of Waterloo Department of Combinatorics and Optimization (1982)."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230130214","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230130214","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T09:16:59Z","timestamp":1697793419000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230130214"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,6]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,6]]}},"alternative-id":["10.1002\/net.3230130214"],"URL":"https:\/\/doi.org\/10.1002\/net.3230130214","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,6]]}}}