{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:00Z","timestamp":1759063800599},"reference-count":16,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2017,6]]},"abstract":"<jats:p>For a positive integer [Formula: see text], a radio k-labeling of a graph [Formula: see text] is a function [Formula: see text] from its vertex set to the non-negative integers such that for all pairs of distinct vertices [Formula: see text] and [Formula: see text], we have [Formula: see text] where [Formula: see text] is the distance between the vertices [Formula: see text] and [Formula: see text] in [Formula: see text]. The minimum span over all radio [Formula: see text]-labelings of [Formula: see text] is called the radio k-chromatic number and denoted by [Formula: see text]. The most extensively studied cases are the classic vertex colorings ([Formula: see text]), [Formula: see text](2,1)-labelings ([Formula: see text]), radio labelings ([Formula: see text], the diameter of [Formula: see text]), and radio antipodal labelings ([Formula: see text]. Determining exact values or tight bounds for [Formula: see text] is often non-trivial even within simple families of graphs. We provide general lower bounds for [Formula: see text] for all cycles [Formula: see text] when [Formula: see text] and show that these bounds are exact values when [Formula: see text].<\/jats:p>","DOI":"10.1142\/s1793830917500318","type":"journal-article","created":{"date-parts":[[2017,3,7]],"date-time":"2017-03-07T08:32:42Z","timestamp":1488875562000},"page":"1750031","source":"Crossref","is-referenced-by-count":5,"title":["Radio k-chromatic number of cycles for large k"],"prefix":"10.1142","volume":"09","author":[{"given":"Nathaniel","family":"Karst","sequence":"first","affiliation":[{"name":"Mathematics and Science Division, Babson College, Babson Park, MA 02457, USA"}]},{"given":"Joshua","family":"Langowitz","sequence":"additional","affiliation":[{"name":"Franklin W. Olin College of Engineering, Olin Way, Needham, MA 02492, USA"}]},{"given":"Jessica","family":"Oehrlein","sequence":"additional","affiliation":[{"name":"Fu Foundation School of Engineering and Applied Sciences, Columbia University, New York, NY 10027, USA"}]},{"given":"Denise Sakai","family":"Troxell","sequence":"additional","affiliation":[{"name":"Mathematics and Science Division, Babson College, Babson Park, MA 02457, USA"}]}],"member":"219","published-online":{"date-parts":[[2017,3,7]]},"reference":[{"key":"S1793830917500318BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2013.06.024"},{"key":"S1793830917500318BIB002","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxl018"},{"issue":"1","key":"S1793830917500318BIB003","doi-asserted-by":"crossref","first-page":"57","DOI":"10.21136\/MB.2002.133978","volume":"127","author":"Chartrand G.","year":"2002","journal-title":"Math. Bohem."},{"key":"S1793830917500318BIB004","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1209"},{"key":"S1793830917500318BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.03.066"},{"key":"S1793830917500318BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(93)E0098-O"},{"key":"S1793830917500318BIB007","doi-asserted-by":"publisher","DOI":"10.1137\/0405048"},{"key":"S1793830917500318BIB008","first-page":"81","volume":"103","author":"Juan J.","year":"2012","journal-title":"Ars Combin."},{"key":"S1793830917500318BIB009","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1348"},{"key":"S1793830917500318BIB010","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1399"},{"issue":"3","key":"S1793830917500318BIB011","doi-asserted-by":"crossref","first-page":"277","DOI":"10.21136\/MB.2005.134100","volume":"130","author":"Khennoufa R.","year":"2005","journal-title":"Math. Bohem."},{"issue":"1","key":"S1793830917500318BIB012","doi-asserted-by":"crossref","first-page":"77","DOI":"10.21136\/MB.2009.140642","volume":"134","author":"Kola S. R.","year":"2009","journal-title":"Math. Bohem."},{"key":"S1793830917500318BIB013","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480102417768"},{"key":"S1793830917500318BIB014","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2011.10.032"},{"key":"S1793830917500318BIB015","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.05.004"},{"key":"S1793830917500318BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2014.11.014"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830917500318","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,3]],"date-time":"2020-10-03T12:53:02Z","timestamp":1601729582000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830917500318"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,7]]},"references-count":16,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2017,2,24]]},"published-print":{"date-parts":[[2017,6]]}},"alternative-id":["10.1142\/S1793830917500318"],"URL":"https:\/\/doi.org\/10.1142\/s1793830917500318","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,7]]}}}