{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T19:04:50Z","timestamp":1775070290693,"version":"3.50.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,11,11]],"date-time":"2020-11-11T00:00:00Z","timestamp":1605052800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,11]],"date-time":"2020-11-11T00:00:00Z","timestamp":1605052800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["2017R1D1A1B03031758"],"award-info":[{"award-number":["2017R1D1A1B03031758"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["2018K2A9A2A06020345"],"award-info":[{"award-number":["2018K2A9A2A06020345"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11811540390"],"award-info":[{"award-number":["11811540390"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s00373-020-02244-y","type":"journal-article","created":{"date-parts":[[2020,11,11]],"date-time":"2020-11-11T17:02:50Z","timestamp":1605114170000},"page":"393-408","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Sharp Upper Bounds on the k-Independence Number in Graphs with Given Minimum and Maximum Degree"],"prefix":"10.1007","volume":"37","author":[{"given":"Suil","family":"O","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9406-7967","authenticated-orcid":false,"given":"Yongtang","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenyu","family":"Taoqiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,11]]},"reference":[{"key":"2244_CR1","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.laa.2016.08.024","volume":"510","author":"A Abiad","year":"2016","unstructured":"Abiad, A., Cioab\u00e1, S.M., Tait, M.: Spectral bounds for the $$k$$-independence number of a graph. Linear Algebra Appl. 510, 160\u2013170 (2016)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"2244_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0963548301004965","volume":"11","author":"N Alon","year":"2002","unstructured":"Alon, N., Mohar, B.: The chromatic number of graph powers. Combin. Probab. Comput. 11(1), 1\u201310 (2002)","journal-title":"Combin. Probab. Comput."},{"key":"2244_CR3","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/j.endm.2005.05.043","volume":"19","author":"M Beis","year":"2005","unstructured":"Beis, M., Duckworth, W., Zito, M.: Large $$k$$-independent sets of regular graphs. Electron. Notes Discrete Math. 19, 321\u2013327 (2005)","journal-title":"Electron. Notes Discrete Math."},{"key":"2244_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0166-218X(96)00078-9","volume":"75","author":"P Firby","year":"1997","unstructured":"Firby, P., Haviland, J.: Independence and average distance in graphs. Discrete Appl. Math. 75, 27\u201337 (1997)","journal-title":"Discrete Appl. Math."},{"key":"2244_CR5","first-page":"33","volume":"86","author":"W Goddard","year":"2008","unstructured":"Goddard, W., Hedetniemi, S.M., Hedetniemi, S.T., Harris, J.M., Rall, D.F.: Broadcast chromatic numbers of graphs. Ars Combin. 86, 33\u201349 (2008)","journal-title":"Ars Combin."},{"key":"2244_CR6","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0012-365X(01)00466-6","volume":"256","author":"G Hahn","year":"2002","unstructured":"Hahn, G., Kratochv\u00edl, J., \u0160ir\u00e1\u0148, J., Sotteau, D.: On the injective chromatic number of graphs. Discrete Math. 256, 179\u2013192 (2002)","journal-title":"Discrete Math."},{"key":"2244_CR7","first-page":"47","volume":"95","author":"MC Kong","year":"1993","unstructured":"Kong, M.C., Zhao, Y.: On computing maximum $$k$$-independent sets. Congr. Numer. 95, 47\u201360 (1993)","journal-title":"Congr. Numer."},{"key":"2244_CR8","first-page":"65","volume":"143","author":"MC Kong","year":"2000","unstructured":"Kong, M.C., Zhao, Y.: Computing $$k$$-Independent sets for regular bipartite graphs. Congr. Numer. 143, 65\u201380 (2000)","journal-title":"Congr. Numer."},{"key":"2244_CR9","unstructured":"Mahdian, M.: The strong chromatic index of graphs. MSc thesis, University of Toronto (2000)"},{"key":"2244_CR10","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice Hall Inc, Upper Saddle River (2001)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02244-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-020-02244-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02244-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,25]],"date-time":"2021-02-25T14:10:50Z","timestamp":1614262250000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-020-02244-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,11]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["2244"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02244-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,11]]},"assertion":[{"value":"22 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 November 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}