{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:29:38Z","timestamp":1753882178289,"version":"3.41.2"},"reference-count":8,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2024,4]]},"abstract":"<jats:p> Chen et al. [On coupon coloring of graphs, Discrete Appl. Math.\u00a0193 (2015) 94\u2013101] had introduced the concept of coupon coloring for any graph with no isolated vertex. A [Formula: see text]-coupon coloring of [Formula: see text] is an assignment of colors from [Formula: see text] to the vertices of [Formula: see text] such that the neighborhood of every vertex of [Formula: see text] contains vertices of all colors from [Formula: see text]. The maximum [Formula: see text] for which a [Formula: see text]-coupon coloring exists is called the coupon coloring number of [Formula: see text], and is denoted by [Formula: see text]. In this paper, we determine the coupon coloring number of Kneser graphs [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830923500209","type":"journal-article","created":{"date-parts":[[2023,3,5]],"date-time":"2023-03-05T04:38:25Z","timestamp":1677991105000},"source":"Crossref","is-referenced-by-count":0,"title":["Coupon coloring of Kneser graph K(n,2)"],"prefix":"10.1142","volume":"16","author":[{"given":"Mehrnoosh","family":"Shadravan","sequence":"first","affiliation":[{"name":"Department of Mathematics, Shahid Beheshti University, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7538-7885","authenticated-orcid":false,"given":"Rajab Ali","family":"Borzooei","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Shahid Beheshti University, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2023,3,31]]},"reference":[{"key":"S1793830923500209BIB001","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.21898"},{"key":"S1793830923500209BIB002","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831470"},{"key":"S1793830923500209BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.04.026"},{"key":"S1793830923500209BIB004","first-page":"90","volume":"308","author":"Chen H.","year":"2017","journal-title":"Appl. Math. Comput."},{"key":"S1793830923500209BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-67899-9_25"},{"key":"S1793830923500209BIB006","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-018-1945-1"},{"key":"S1793830923500209BIB007","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-015-9942-2"},{"key":"S1793830923500209BIB008","doi-asserted-by":"publisher","DOI":"10.26493\/2590-9770.1507.dc5"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830923500209","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,7]],"date-time":"2024-02-07T06:32:14Z","timestamp":1707287534000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830923500209"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,31]]},"references-count":8,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["10.1142\/S1793830923500209"],"URL":"https:\/\/doi.org\/10.1142\/s1793830923500209","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2023,3,31]]},"article-number":"2350020"}}