{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T13:08:36Z","timestamp":1773320916685,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"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":5525,"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":[[1998,6]]},"DOI":"10.1016\/s0012-365x(98)00048-x","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T16:52:26Z","timestamp":1053363146000},"page":"239-243","source":"Crossref","is-referenced-by-count":14,"title":["A lower bound on the independence number of a graph"],"prefix":"10.1016","volume":"188","author":[{"given":"Jochen","family":"Harant","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00048-X_BIB1","unstructured":"Y. Caro, unpublished."},{"key":"10.1016\/S0012-365X(98)00048-X_BIB2","unstructured":"S. Fajtlowicz, On conjectures of Graffiti, preprint."},{"key":"10.1016\/S0012-365X(98)00048-X_BIB3","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1002\/jgt.3190150107","article-title":"On the residue of a graph","volume":"15","author":"Favaron","year":"1991","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(98)00048-X_BIB4","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0012-365X(92)00479-B","article-title":"Independence and the Havel-Hakimi residue","volume":"127","author":"Griggs","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00048-X_BIB5","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1137\/0110037","article-title":"On the realizability of a set of integers as degrees of the vertices of a graph","volume":"10","author":"Hakimi","year":"1962","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0012-365X(98)00048-X_BIB6","unstructured":"J. Harant, A. Pruchnewski, M. Voigt, On dominating sets and independent sets of graphs, submitted."},{"key":"10.1016\/S0012-365X(98)00048-X_BIB7","doi-asserted-by":"crossref","first-page":"477","DOI":"10.21136\/CPM.1955.108220","article-title":"A remark on the existence of finite graphs","volume":"80","author":"Havel","year":"1955","journal-title":"\u010casopis P\u011bst. Mat"},{"key":"10.1016\/S0012-365X(98)00048-X_BIB8","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","article-title":"Maxima for graphs and a new proof of a theorem of Tur\u00e1n","volume":"17","author":"Motzkin","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0012-365X(98)00048-X_BIB9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0012-365X(91)90357-8","article-title":"Lower bounds on the stability number of graphs computed in terms of degrees","volume":"90","author":"Murphy","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00048-X_BIB10","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0012-365X(93)90307-F","article-title":"The independence number of graphs in terms of degrees","volume":"122","author":"Selkow","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00048-X_BIB11","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0012-365X(93)00102-B","article-title":"A probabilistic lower bound on the independence number of graphs","volume":"132","author":"Selkow","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00048-X_BIB12","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/(SICI)1097-0118(199605)22:1<89::AID-JGT12>3.0.CO;2-J","article-title":"Degree sequences of graphs and dominance order","volume":"22","author":"Triesch","year":"1996","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(98)00048-X_BIB13","article-title":"A lower bound on the stability number of a simple graph","author":"Wei","year":"1981"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9800048X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9800048X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,9]],"date-time":"2021-05-09T01:01:05Z","timestamp":1620522065000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X9800048X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S0012365X9800048X"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00048-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}