A five-color theorem
An edge-face coloring of a plane graph is a function assigning colors to the edges and faces of the graph in such a way that any two elements which are either adjacent or incident receive distinct colors. In this paper it is shown that any plane graph of maximum degree three is edge-face 5-colorable and this bound is sharp.
scientific article; zbMATH DE number 1462291