{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T06:23:11Z","timestamp":1725776591366},"reference-count":11,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":3485,"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":[[2004,1]]},"DOI":"10.1016\/s0012-365x(03)00109-2","type":"journal-article","created":{"date-parts":[[2003,6,20]],"date-time":"2003-06-20T22:47:46Z","timestamp":1056149266000},"page":"237-263","source":"Crossref","is-referenced-by-count":3,"title":["Semi-regular graphs of minimum independence number"],"prefix":"10.1016","volume":"275","author":[{"given":"P.","family":"Nelson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.J.","family":"Radcliffe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00109-2_BIB1","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(74)90133-2","article-title":"On the connection between chromatic number, maximal clique and minimal degree of a graph","volume":"8","author":"Andr\u00e1sfai","year":"1974","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/S0012-365X(03)00109-2_BIB2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1017\/S0963548399003831","article-title":"On the structure of dense triangle-free graphs","volume":"8","author":"Brandt","year":"1999","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/S0012-365X(03)00109-2_BIB3","doi-asserted-by":"crossref","unstructured":"S. Brandt, T. Pisanski, Another infinite sequence of dense triangle-free graphs, Electron. J. Combin. 5(1), Research Paper 43 (electronic), 1998, 5pp.","DOI":"10.37236\/1381"},{"key":"10.1016\/S0012-365X(03)00109-2_BIB4","unstructured":"Y. Caro, New results on the independence number, Technical Report, 05-79, Tel Aviv University, 1979."},{"issue":"1","key":"10.1016\/S0012-365X(03)00109-2_BIB5","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"},{"issue":"1\u20133","key":"10.1016\/S0012-365X(03)00109-2_BIB6","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0012-365X(92)00479-B","article-title":"Independence and the Havel\u2013Hakimi residue","volume":"127","author":"Griggs","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00109-2_BIB7","doi-asserted-by":"crossref","unstructured":"R. H\u00e4ggkvist, Odd cycles of specified length in nonbipartite graphs, in: Graph Theory (Cambridge, 1981), North-Holland, Amsterdam, 1982, pp. 89\u201399.","DOI":"10.1016\/S0304-0208(08)73552-7"},{"key":"10.1016\/S0012-365X(03)00109-2_BIB8","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0111010","article-title":"On realizability of a set of integers as degrees of the vertices of a linear graph, II. Uniqueness","volume":"11","author":"Hakimi","year":"1963","journal-title":"J. Soc. Indust. Appl. Math."},{"key":"10.1016\/S0012-365X(03)00109-2_BIB9","unstructured":"P. Nelson, Minimum independence number of graphs with specified degree sequences, Ph.D. Thesis, University of Nebraska-Lincoln, Lincoln, NE, 2001."},{"key":"10.1016\/S0012-365X(03)00109-2_BIB10","first-page":"436","article-title":"Eine Extremalaufgabe aus der Graphentheorie","volume":"48","author":"Tur\u00e1n","year":"1941","journal-title":"Mat. Fiz. Lapok"},{"key":"10.1016\/S0012-365X(03)00109-2_BIB11","unstructured":"V.K. Wei, A lower bound on the stability number of a simple graph, Technical Report, TM 81-11217-9, Bell Labs, 1981."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03001092?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03001092?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,22]],"date-time":"2020-03-22T07:37:30Z","timestamp":1584862650000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03001092"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":11,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0012365X03001092"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00109-2","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}