{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T09:45:46Z","timestamp":1648979146440},"reference-count":4,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2016,6]]},"abstract":"<jats:p> A subset [Formula: see text] is acyclic if it induces an acyclic subdigraph of a digraph [Formula: see text] and the dichromatic number [Formula: see text] of [Formula: see text] is defined to be the minimum integer [Formula: see text] such that [Formula: see text] can be partitioned into [Formula: see text] acyclic subsets. In this paper, we obtain lower and upper bounds for the dichromatic number of a generalized lexicographic product and the dichromatic number of a generalized corona of digraphs in terms of dichromatic numbers of those digraphs. <\/jats:p>","DOI":"10.1142\/s1793830916500348","type":"journal-article","created":{"date-parts":[[2016,3,17]],"date-time":"2016-03-17T08:48:16Z","timestamp":1458204496000},"page":"1650034","source":"Crossref","is-referenced-by-count":2,"title":["Bounds for the dichromatic number of a generalized lexicographic product of digraphs"],"prefix":"10.1142","volume":"08","author":[{"given":"Nopparat","family":"Pleanmani","sequence":"first","affiliation":[{"name":"Department of Mathematics, Faculty of Sciences, Chiang Mai University, Chiang Mai, 50200, Thailand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sayan","family":"Panma","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Faculty of Sciences, Chiang Mai University, Chiang Mai, 50200, Thailand"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2016,5,26]]},"reference":[{"key":"S1793830916500348BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-998-1"},{"key":"S1793830916500348BIB002","first-page":"617","volume":"312","author":"Harutyunyan A.","year":"2012","journal-title":"Discrete Math."},{"key":"S1793830916500348BIB003","doi-asserted-by":"publisher","DOI":"10.1515\/9783110255096"},{"key":"S1793830916500348BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(82)90046-6"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830916500348","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T01:05:01Z","timestamp":1565139901000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830916500348"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,26]]},"references-count":4,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2016,5,26]]},"published-print":{"date-parts":[[2016,6]]}},"alternative-id":["10.1142\/S1793830916500348"],"URL":"https:\/\/doi.org\/10.1142\/s1793830916500348","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,26]]}}}