We begin by discussing binary relations and functions. Graphs are then introduced, following from binary relations. Some standard graphs are defined, as are connectness and degree. We discuss the Königsberg Bridge problem and traversability. Then general walks are introduced, together with paths and cycles. We then define trees, cycles, and Hamilton circuits, and discuss the Traveling Salesman problem. Finally, we look at graph coloring.