A six-color theorem for the edge-face coloring of plane graphs
The authors show that the set of edges and faces in a plane graph with the maximum degree of vertices not greater than 3 can be properly colored by 6 colors.
scientific article; zbMATH DE number 778544