In a previous paper, the authors proved a conjecture of Melnikov that the edges and faces of a plane graph of maximum degree D may be simultaneously colored with at most D 3 colors. In this paper, the theorem is reproved with a more direct technique, which also yields improvements. For D 5, the theorem is extended to multigraphs. For D ! 7, it is shown that D 2 colors suce.