In this section, we'll learn about the Seven Bridges of Konigsberg, the first problem known to be solved by graph theory. Then we'll learn a characterization for graphs containing Eulerian paths. Then we'll apply this knowledge to decide whether some given graphs are Eulerian or not.