{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T09:15:45Z","timestamp":1649063745589},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5130,"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":[[1999,7]]},"DOI":"10.1016\/s0012-365x(99)00026-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T08:12:16Z","timestamp":1027584736000},"page":"211-216","source":"Crossref","is-referenced-by-count":3,"title":["Some operations preserving the existence of kernels"],"prefix":"10.1016","volume":"205","author":[{"given":"Mostafa","family":"Blidia","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Duchet","sequence":"additional","affiliation":[]},{"given":"Henry","family":"Jacob","sequence":"additional","affiliation":[]},{"given":"Fr\u00e9d\u00e9ric","family":"Maffray","sequence":"additional","affiliation":[]},{"given":"Henry","family":"Meyniel","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(99)00026-6_BIB1","unstructured":"C. Berge, Graphs, North-Holland, Amsterdam\/New York, 1985."},{"key":"10.1016\/S0012-365X(99)00026-6_BIB2","unstructured":"C. Berge, P. Duchet, S\u00e9minaire MSH, Paris, January 1983."},{"key":"10.1016\/S0012-365X(99)00026-6_BIB3","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0012-365X(95)00096-F","article-title":"Perfect graphs are kernel-solvable","volume":"159","author":"Boros","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)00026-6_BIB4","unstructured":"V. Chv\u00e1tal, On the computational complexity of finding a kernel, Report CRM300, Centre de Recherches Math\u00e9matiques, Universit\u00e9 de Montr\u00e9al, 1973."},{"key":"10.1016\/S0012-365X(99)00026-6_BIB5","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0166-218X(81)90003-2","article-title":"Planar Kernel and Grundy with d\u2a7d 3, dout \u2a7d 2, din\u2a7d 2, are NP-complete","volume":"3","author":"Fraenkel","year":"1981","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(99)00026-6_BIB6","doi-asserted-by":"crossref","unstructured":"M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.","DOI":"10.1016\/B978-0-12-289260-8.50010-8"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99000266?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99000266?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T05:04:33Z","timestamp":1578459873000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X99000266"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,7]]}},"alternative-id":["S0012365X99000266"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(99)00026-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}