{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:47Z","timestamp":1753893827180,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>We study two parameters that arise from the dichromatic number and the vertex-arboricity in the same way that the achromatic number comes from the chromatic number. The adichromatic number\u00a0of a digraph is the largest number of colors its vertices can be colored with such that every color induces an acyclic subdigraph but merging any two colors yields a monochromatic directed cycle. Similarly, the a-vertex arboricity\u00a0of an undirected graph is the largest number of colors that can be used such that every color induces a forest but merging any two yields a monochromatic cycle. We study the relation between these parameters and their behavior with respect to other classical parameters such as degeneracy and most importantly feedback vertex sets.<\/jats:p>","DOI":"10.37236\/8752","type":"journal-article","created":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T02:20:04Z","timestamp":1590718804000},"source":"Crossref","is-referenced-by-count":1,"title":["Complete Acyclic Colorings"],"prefix":"10.37236","volume":"27","author":[{"given":"Stefan","family":"Felsner","sequence":"first","affiliation":[]},{"given":"Winfried","family":"Hochst\u00e4ttler","sequence":"additional","affiliation":[]},{"given":"Kolja","family":"Knauer","sequence":"additional","affiliation":[]},{"given":"Raphael","family":"Steiner","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2020,5,29]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i2p40\/8097","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i2p40\/8097","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T02:20:05Z","timestamp":1590718805000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v27i2p40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,29]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2020,4,3]]}},"URL":"https:\/\/doi.org\/10.37236\/8752","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2020,5,29]]},"article-number":"P2.40"}}