A five-color theorem

In this note, we show that the edges and faces of any plane graph with maximum degree three can be simultaneously colored with five colors. (C) 2000 Elsevier Science B.V. All rights reserved

A Five-Color Theorem

In this note, we show that the edges and faces of any plane graph with maximum degree three can be simultaneously colored with five colors. © 2000 Elsevier Science B.V. All rights reserved