It is proved that every graph embedded in a fixed surface with sufficiently large edge-width is acyclically 7-colorable and that its star chromatic number is at most 2s ∗ 0 +3, where s ∗ 0 ≤ 20 is the maximum star chromatic number for the class of all planar graphs
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.