{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T22:05:05Z","timestamp":1778364305406,"version":"3.51.4"},"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":6433,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1989,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We give a new bound on the number of maximal cliques in a graph, along with a bound on the length of odd antiholes that the graph can contain. Based on these bounds we then identify a family of graphs with polynomially solvable maximum weight clique problem, using the edgebicoloring approach developed in a recent paper by Balas, Chvatal, and Nesetril.<\/jats:p>","DOI":"10.1002\/net.3230190206","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T02:28:23Z","timestamp":1178936903000},"page":"247-253","source":"Crossref","is-referenced-by-count":96,"title":["On graphs with polynomially solvable maximum\u2010weight clique problem"],"prefix":"10.1002","volume":"19","author":[{"given":"Egon","family":"Balas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chang Sung","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.12.3.522"},{"key":"e_1_2_1_3_2","unstructured":"K.Cameron Induced Matchings. University of Waterloo February (1987)."},{"key":"e_1_2_1_4_2","unstructured":"M.Farber Bridged graphs and geodesic convexity. Technical Report AT&T Bell Labs (1985)."},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","unstructured":"J. W.MoonaandL.Moser On cliques in graphs.Israel J. Math.(1965)23\u201328.","DOI":"10.1007\/BF02760024"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1137\/0210022"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230190206","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230190206","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T04:19:19Z","timestamp":1697948359000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230190206"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,3]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,3]]}},"alternative-id":["10.1002\/net.3230190206"],"URL":"https:\/\/doi.org\/10.1002\/net.3230190206","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,3]]}}}