{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T18:49:52Z","timestamp":1648666192887},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2015,12]]},"abstract":"<jats:p>The clique-chromatic number of a graph [Formula: see text], [Formula: see text], is the least number of colors on [Formula: see text] without a monocolored maximal clique of size at least two. If [Formula: see text] is triangle-free, [Formula: see text]; we then consider only graphs with a triangle. Unlike the chromatic number, the clique-chromatic number of a graph is not necessary to be at least those of its subgraphs. Thus, for any family of graphs [Formula: see text], the boundedness of [Formula: see text][Formula: see text] has been investigated. Many families of graphs are proved to have a bounded set of clique-chromatic numbers. In literature, only few families of graphs are shown to have an unbounded set of clique-chromatic numbers, for instance, the family of line graphs. This paper gives another family of graphs with such an unbounded set. These graphs are obtained by the well-known Mycielski\u2019s construction with a certain property of the initial graph.<\/jats:p>","DOI":"10.1142\/s179383091550055x","type":"journal-article","created":{"date-parts":[[2015,10,9]],"date-time":"2015-10-09T09:25:45Z","timestamp":1444382745000},"page":"1550055","source":"Crossref","is-referenced-by-count":0,"title":["Graphs with large clique-chromatic numbers"],"prefix":"10.1142","volume":"07","author":[{"given":"Tanawat","family":"Wichianpaisarn","sequence":"first","affiliation":[{"name":"Department of Mathematics, Faculty of Applied Science, King Mongkut\u2019s University of Technology North Bangkok, Pracharat 1 Rd., Bangkok 10800, Thailand"}]},{"given":"Chariya","family":"Uiyyasathian","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, Faculty of Science, Chulalongkorn University, Phyathai Rd., Patumwan, Bangkok 10330, Thailand"}]}],"member":"219","published-online":{"date-parts":[[2016,1,4]]},"reference":[{"key":"S179383091550055XBIB001","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480199359995"},{"key":"S179383091550055XBIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2008.01.033"},{"key":"S179383091550055XBIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2009.11.047"},{"key":"S179383091550055XBIB004","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(91)90083-S"},{"key":"S179383091550055XBIB005","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(91)90009-6"},{"key":"S179383091550055XBIB006","doi-asserted-by":"crossref","first-page":"13","DOI":"10.37236\/1458","volume":"6","author":"Mohar B.","year":"1999","journal-title":"Electron. J. Combin."},{"key":"S179383091550055XBIB007","doi-asserted-by":"publisher","DOI":"10.4064\/cm-3-2-161-162"},{"key":"S179383091550055XBIB008","volume-title":"Introduction to Graph Theory","author":"West D. B.","year":"2001"},{"key":"S179383091550055XBIB009","first-page":"152","volume":"15","author":"Wichianpaisarn T.","year":"2013","journal-title":"East-West J. Math."},{"key":"S179383091550055XBIB010","first-page":"285","volume":"118","author":"Wichianpaisarn T.","year":"2015","journal-title":"Ars. Combin."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S179383091550055X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,9]],"date-time":"2020-09-09T12:43:12Z","timestamp":1599655392000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S179383091550055X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12]]},"references-count":10,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2016,1,4]]},"published-print":{"date-parts":[[2015,12]]}},"alternative-id":["10.1142\/S179383091550055X"],"URL":"https:\/\/doi.org\/10.1142\/s179383091550055x","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12]]}}}