{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:10:19Z","timestamp":1753881019233,"version":"3.41.2"},"reference-count":21,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","funder":[{"DOI":"10.13039\/100020201","name":"Indian Institute of Technology Palakkad","doi-asserted-by":"crossref","award":["PDF191005"],"award-info":[{"award-number":["PDF191005"]}],"id":[{"id":"10.13039\/100020201","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2023,2]]},"abstract":"<jats:p> Indicated coloring is a graph coloring game in which two players collectively color the vertices of a graph in the following way. In each round, the first player (Ann) selects a vertex, and then the second player (Ben) colors it properly, using a fixed set of colors. The goal of Ann is to achieve a proper coloring of the whole graph, while Ben is trying to prevent the realization of this project. The smallest number of colors necessary for Ann to win the game on a graph G (regardless of Ben\u2019s strategy) is called the indicated chromatic number of G, denoted by [Formula: see text]. In this paper, we examine whether the Mycielskian of G, [Formula: see text], is k-indicated colorable for all [Formula: see text], whenever G is l-indicated colorable for all [Formula: see text]. In this direction, we prove that the Mycielskian of the bipartite graphs, complete multipartite graphs, [Formula: see text]-free graphs, [Formula: see text]-free graphs, [Formula: see text]-free graphs and [Formula: see text]-free graphs are k-indicated colorable for all k greater than or equal to the indicated chromatic number of the corresponding graphs. <\/jats:p>","DOI":"10.1142\/s1793830922500690","type":"journal-article","created":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T08:22:55Z","timestamp":1647246175000},"source":"Crossref","is-referenced-by-count":0,"title":["Indicated coloring of the Mycielskian of some families of graphs"],"prefix":"10.1142","volume":"15","author":[{"given":"P.","family":"Francis","sequence":"first","affiliation":[{"name":"Department of Computer Science, Indian Institute of Technology Palakkad, Kerala 678557, India"}]}],"member":"219","published-online":{"date-parts":[[2022,3,12]]},"reference":[{"key":"S1793830922500690BIB001","doi-asserted-by":"crossref","first-page":"2607","DOI":"10.1016\/j.disc.2007.05.004","volume":"308","author":"Balakrishnan R.","year":"2008","journal-title":"Discrete Math."},{"key":"S1793830922500690BIB002","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0012-365X(93)90477-B","volume":"115","author":"Bl\u00e1zsik Z.","year":"1993","journal-title":"Discrete Math."},{"key":"S1793830922500690BIB003","doi-asserted-by":"crossref","first-page":"3398","DOI":"10.1016\/j.disc.2010.08.005","volume":"310","author":"Choudum S. A.","year":"2010","journal-title":"Discrete Math."},{"key":"S1793830922500690BIB004","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0012-365X(98)00197-6","volume":"196","author":"Dinski T.","year":"1999","journal-title":"Discrete Math."},{"key":"S1793830922500690BIB005","first-page":"143","volume":"35","author":"Faigle U.","year":"1993","journal-title":"Ars Combin."},{"key":"S1793830922500690BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)00126-1"},{"key":"S1793830922500690BIB007","first-page":"143","volume":"154","author":"Francis P.","year":"2021","journal-title":"Ars Combin."},{"key":"S1793830922500690BIB008","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1007\/s00373-019-02061-y","volume":"35","author":"Francis P.","year":"2019","journal-title":"Graphs Combin."},{"key":"S1793830922500690BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2012.07.001"},{"key":"S1793830922500690BIB010","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1002\/jgt.10128","volume":"44","author":"Hajibolhassan D.","year":"2003","journal-title":"J. Graph Theory"},{"key":"S1793830922500690BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.07.004"},{"key":"S1793830922500690BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2005.11.001"},{"key":"S1793830922500690BIB013","doi-asserted-by":"publisher","DOI":"10.4064\/cm-3-2-161-162"},{"key":"S1793830922500690BIB014","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0020-0190(88)90143-3","volume":"28","author":"Olariu S.","year":"1988","journal-title":"Inf. Process. Lett."},{"key":"S1793830922500690BIB015","doi-asserted-by":"crossref","first-page":"2357","DOI":"10.1007\/s00373-014-1508-z","volume":"31","author":"Raj R. P.","year":"2015","journal-title":"Graphs Combin."},{"key":"S1793830922500690BIB016","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1007\/s00373-012-1151-5","volume":"29","author":"Raj S. F.","year":"2013","journal-title":"Graphs Combin."},{"key":"S1793830922500690BIB017","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s00373-016-1747-2","volume":"33","author":"Raj S. F.","year":"2017","journal-title":"Graphs Combin."},{"key":"S1793830922500690BIB018","first-page":"557","volume-title":"The Theory and Applications of Graphs","author":"Sumner D. P.","year":"1981"},{"key":"S1793830922500690BIB019","volume-title":"Introduction to Graph Theory","volume":"2","author":"West D. B.","year":"2000"},{"key":"S1793830922500690BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.05.023"},{"key":"S1793830922500690BIB021","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1998.1878"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922500690","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T03:00:28Z","timestamp":1677726028000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922500690"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,12]]},"references-count":21,"journal-issue":{"issue":"02","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["10.1142\/S1793830922500690"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922500690","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2022,3,12]]},"article-number":"2250069"}}