Key points are not available for this paper at this time.
Using the existence of noncrossing Eulerian circuits in Eulerian plane graphs, we give a short constructive proof of the theorem of Heawood that Eulerian triangulations are 3colorable.
Tsai et al. (Mon,) studied this question.