On simultaneous colorings of embedded graphs Original Research Article

In this paper, it is shown that if the maximum degree Δ of a graph is large relative to the genus of the embedding than the edge-face chromatic number of the graph is at most Δ+1 and its vertex-edge-face chromatic number is at most Δ+2. Both results are best possible.