+
Worksheet
Curated OER

Polygons and Vertices

For Students 9th - 12th
In this geometry worksheet, learners analyze different polygons and relate it to a circuit board. They find the odd degree Euler circuit and identify the vertices of the odd degree. There are 3 questions with an answer key.
+
Article
Other

The University of Edinburgh: Discrete Mathematics Graphs

For Students 10th - 12th
This article is an in-depth look at graphs. Topics covered are graph models, terminology, representations of graphs, graph isomorphism, connectivity, Euler and Hamiltonian Paths, and more. Examples and explanations are included.
+
eBook
Other

Discrete Mathematics: Euler Paths and Circuits

For Students 10th - 12th
Explanation and questions about Euler paths and circuits with solutions to the questions.
+
Interactive
National Council of Teachers of Mathematics

Nctm: Illuminations: Graph Creator

For Students 3rd - 8th
Use this vertex-edge tool to create graphs and explore them. Investigate ideas such as planar graphs, complete graphs, minimum-cost spanning trees, and Euler and Hamiltonian paths.
+
Article
Other

Free Codecamp: How to Think in Graphs

For Students 10th - 12th
In this article, we're going to demonstrate various applications of graph theory. These applications will contain detailed illustrations. As the author states, if you've been looking for a "graph theory and everything about it tutorial...
+
Activity
National Council of Teachers of Mathematics

The Math Forum: The Beginnings of Topology Leonard Euler

For Students 9th - 10th
This site gives a general description of one of Euler's contributions, topology. It also presents one of the more famous problems of mathematics, The Bridges of Konigsberg.
+
Handout
Wolfram Research

Wolfram Math World: Hamiltonian Path

For Students 9th - 10th
A description of a Hamiltonian path, also called a Hamilton path.
+
Activity
Varsity Tutors

Varsity Tutors: Hotmath: Algebra Review: Traceability of Graphs

For Students 9th - 10th
Find a quick, concise explanation of how to test the traceability of graphs. An example is given and clearly explained.