This chapter considers Eulerian graphs, a class of graphs named for the Swiss mathematician Leonhard Euler. It begins with a discussion of the the Königsberg Bridge Problem and its connection to Euler, who presented the first solution of the problem in a 1735 paper. Euler showed that it was impossible to stroll through the city of Königsberg, the capital of German East Prussia, and cross each bridge exactly once. He also mentioned in his paper a problem whose solution uses the geometry of position to which Gottfried Leibniz had referred. The chapter concludes with another problem, the Chinese Postman Problem, which deals with minimizing the length of a round-trip that a letter carrier might take.