Title: A new proof of 3-colorability of Eulerian triangulations
Abstract: 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 3-colorable.