-
Graph Theory for Kids
- Planar graph of regular hexahedron
- Planar graph of regular octahedron
- Planar graph of a dodecahedron
- The smallest four-colouring mosaic
- Four color challenge
- Dodecahedron coloring
- Vertex coloring
- Four colour theorem
- Petersen Graph
- Cat Maze
- Turtle in the labyrinth
- Eulerian Path by Turtle
- Simple Eulerian graphs
- Euler Circuit
- Minimum Spanning Tree Demonstration
- Miami University Campus Traveling Salesman Problem
- The Shortest Path in the Graph
- Aplicació Dijkstra
- Travelling salesman
- Voronoi Diagram Animation
- Kopie materiálu Icosian Game
This activity is also part of one or more other Books. Modifications will be visible in all these Books. Do you want to modify the original activity or create your own copy for this Book instead?
This activity was created by '{$1}'. Do you want to modify the original activity or create your own copy instead?
This activity was created by '{$1}' and you lack the permission to edit it. Do you want to create your own copy instead and add it to the book?
Graph Theory for Kids
Šárka Voráčová, Jan 31, 2017
We wanted to explore some elementary ideas in graph theory, which we view as mathematically rich, yet accessible to children. GeoGebra book is inpired by Joel David Hamkins articles on graph theory for seven and eight olds. http://jdh.hamkins.org/math-for-seven-year-olds-graph-coloring-chromatic-numbers-eulerian-paths/
-
1. Planar graph of regular hexahedron
-
2. Planar graph of regular octahedron
-
3. Planar graph of a dodecahedron
-
4. The smallest four-colouring mosaic
-
5. Four color challenge
-
6. Dodecahedron coloring
-
7. Vertex coloring
-
8. Four colour theorem
-
9. Petersen Graph
-
10. Cat Maze
-
11. Turtle in the labyrinth
-
12. Eulerian Path by Turtle
-
13. Simple Eulerian graphs
-
14. Euler Circuit
-
15. Minimum Spanning Tree Demonstration
-
16. Miami University Campus Traveling Salesman Problem
-
17. The Shortest Path in the Graph
-
18. Aplicació Dijkstra
-
19. Travelling salesman
-
20. Voronoi Diagram Animation
-
21. Kopie materiálu Icosian Game
Planar graph of regular hexahedron
Move the gray vertices of the hexahedron on the left picture to get planar graph on the right.
Planar graph (Schlegel diagram) of a convex polyhedra lack scale, distance and shape, but the relationship between points is maintained.
Euler's formula states that if a finite, connected, planar graph is drawn in the plane without any edge intersections, and v is the number of vertices, e is the number of edges and f is the number of faces (regions bounded by edges, including the outer, infinitely large region), then v - e + f = 2. Thanks to Schlegel diagram it is clear that Euler's formula is also valid for convex polyhedra.
The skeleton of hexahedron (the vertices and edges) form a graph. It is one of 5 Platonic graphs, each a skeleton of its Platonic solid.
Saving…
All changes saved
Error
A timeout occurred. Trying to re-save …
Sorry, but the server is not responding. Please wait a few minutes and then try to save again.