{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:28:25Z","timestamp":1753885705830,"version":"3.41.2"},"reference-count":5,"publisher":"World Scientific Pub Co Pte Ltd","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:p> Sampathkumar [F. Harary, Graph Theory (Addison-Wesley, Reading, MA, 1969)] defined the coloring of a digraph [Formula: see text] as a coloring of its vertices by the following rule: Let [Formula: see text] be an arc in [Formula: see text]. If the tail [Formula: see text] is colored first, then the head [Formula: see text] should receive a color different from that of [Formula: see text]. But, if [Formula: see text] is colored first, then [Formula: see text] may or may not receive the color of [Formula: see text]. The dichromatic number [Formula: see text] of a digraph [Formula: see text] is the minimum number of colors needed for coloring of a digraph [Formula: see text]. In this paper, we obtain some results on uniquely colorable digraphs and Nordhaus\u2013Gaddum type results for digraphs. <\/jats:p>","DOI":"10.1142\/s1793830921500713","type":"journal-article","created":{"date-parts":[[2020,12,14]],"date-time":"2020-12-14T07:15:10Z","timestamp":1607930110000},"source":"Crossref","is-referenced-by-count":0,"title":["Results on uniquely colorable digraphs"],"prefix":"10.1142","volume":"13","author":[{"given":"K.","family":"Dhanalakshmi","sequence":"first","affiliation":[{"name":"Department of Mathematics, Holy Cross College, Trichy 620 002, India"}]},{"given":"K. A.","family":"Germina","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Central University of Kerala, India"}]},{"given":"J. Amalorpava","family":"Jerline","sequence":"additional","affiliation":[{"name":"Department of Mathematics, St. Joseph\u2019s College, Trichy 620 002, India"}]},{"given":"L. Benedict Michael","family":"Raj","sequence":"additional","affiliation":[{"name":"Department of Mathematics, St. Joseph\u2019s College, Trichy 620 002, India"}]}],"member":"219","published-online":{"date-parts":[[2021,1,11]]},"reference":[{"key":"S1793830921500713BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8505-7"},{"key":"S1793830921500713BIB003","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364"},{"key":"S1793830921500713BIB004","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"Jorgen B.-J.","year":"2009","edition":"2"},{"key":"S1793830921500713BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(82)90046-6"},{"volume-title":"Basic Graph Theory","year":"1994","author":"Parthasarathy K. R.","key":"S1793830921500713BIB006"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830921500713","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,8]],"date-time":"2021-12-08T11:34:55Z","timestamp":1638963295000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830921500713"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,11]]},"references-count":5,"journal-issue":{"issue":"06","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["10.1142\/S1793830921500713"],"URL":"https:\/\/doi.org\/10.1142\/s1793830921500713","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2021,1,11]]},"article-number":"2150071"}}