{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T14:58:49Z","timestamp":1703084329832},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3796,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0012-365x(02)00877-4","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:18:15Z","timestamp":1049501895000},"page":"351-356","source":"Crossref","is-referenced-by-count":8,"title":["Independent sets of maximum weight in (p,q)-colorable graphs"],"prefix":"10.1016","volume":"265","author":[{"given":"Vladimir E.","family":"Alekseev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vadim V.","family":"Lozin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(02)00877-4_BIB1","unstructured":"V.E. Alekseev, On the local restrictions effect on the complexity of finding the graph independence number, Combinatorial-algebraic methods in applied mathematics, Gorkiy Univ. Press, Gorkiy, 1983, pp. 3\u201313 (in Russian)."},{"key":"10.1016\/S0012-365X(02)00877-4_BIB2","unstructured":"V.E. Alekseev, On the number of maximal independent sets in graphs from hereditary classes, Combinatorial-algebraic methods in discrete optimization, University of Nizhny Novgorod, 1991, pp. 5\u20138 (in Russian)."},{"key":"10.1016\/S0012-365X(02)00877-4_BIB3","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1002\/net.3230190206","article-title":"On graphs with polynomially solvable maximum-weight clique problem","volume":"19","author":"Balas","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0012-365X(02)00877-4_BIB4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(96)00114-X","article-title":"A nice class for the vertex packing problem","volume":"76","author":"Bertolazzi","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(02)00877-4_BIB5","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1017\/S030500410002168X","article-title":"On coloring the nodes of a network","volume":"37","author":"Brooks","year":"1941","journal-title":"Proc. Cambridge Phil. Soc."},{"key":"10.1016\/S0012-365X(02)00877-4_BIB6","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0166-218X(85)90027-7","article-title":"The complexity of generalized clique packing","volume":"12","author":"Corneil","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(02)00877-4_BIB7","first-page":"311","article-title":"Split graphs","volume":"19","author":"Foldes","year":"1977","journal-title":"Congres. Numer."},{"key":"10.1016\/S0012-365X(02)00877-4_BIB8","series-title":"Ramsey Theory","author":"Graham","year":"1980"},{"key":"10.1016\/S0012-365X(02)00877-4_BIB9","first-page":"325","article-title":"Polynomial algorithms for perfect graphs","volume":"21","author":"Gr\u00f6tschel","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0012-365X(02)00877-4_BIB10","first-page":"471","article-title":"Matching theory","volume":"29","author":"Lov\u00e1sz","year":"1986","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0012-365X(02)00877-4_BIB11","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","article-title":"On maximal independent sets of vertices in claw-free graphs","volume":"28","author":"Minty","year":"1980","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"10.1016\/S0012-365X(02)00877-4_BIB12","first-page":"194","article-title":"A revision of Minty's algorithm for finding a maximum weight stable set of a claw-free graph","volume":"44","author":"Nakamura","year":"2001","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"10.1016\/S0012-365X(02)00877-4_BIB13","first-page":"307","article-title":"A note on stable sets and coloring of graphs","volume":"15","author":"Poljak","year":"1974","journal-title":"Comment. Math. Univ. Carolinae"},{"key":"10.1016\/S0012-365X(02)00877-4_BIB14","unstructured":"E. Prisner, Graphs with few cliques, Graph Theory, Combinatorics, and Algorithms, Vol. 1, 2 (Kalamazoo, MI, 1992), 945\u2013956, Wiley-Interscience Publ., Wiley, New York, 1995."},{"key":"10.1016\/S0012-365X(02)00877-4_BIB15","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0012-365X(90)90287-R","article-title":"Algorithme de recherche d'un stable de cardinalit\u00e9 maximum dans un graphe sans \u00e9toile","volume":"29","author":"Sbihi","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(02)00877-4_BIB16","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/0206036","article-title":"A new algorithm for generating all the maximal independent sets","volume":"6","author":"Tsukiyama","year":"1977","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X02008774?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X02008774?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T08:52:18Z","timestamp":1553676738000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X02008774"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0012365X02008774"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(02)00877-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}