GeoGebra
GeoGebra
  • Searching for Eulerian and Hamiltonian Paths
      Graph 1
      Graph 2
      Graph 3
      Graph 4
      Graph 5
      Graph 6

Searching for Eulerian and Hamiltonian Paths

Author:
vinylmath
Topic:
Function Graph
Study each of the 6 graphs provided. For each graph, find a Eulerian Path if one exists (i.e., a path for which each edge can be traversed exactly one time). Next, find a Hamiltonian Path if one exists (i.e., a path that visits each point exactly once).

  • Graph 1

  • Graph 2

  • Graph 3

  • Graph 4

  • Graph 5

  • Graph 6

Next
Graph 1

New Resources

  • Open Middle Cyclic Quadrilateral Exercise
  • Open Middle: Graphing Linear Inequalities (3)
  • Simple Bridge (GeoGebra 3D Workshop)
  • INVESTIGATION - Linear solutions
  • Umbrella Holder

Discover Resources

  • Introduction to 'Number Machines' (functions)
  • alphaT2
  • Folien der Präsentation
  • UnitCircleExploration
  • משימה 1

Discover Topics

  • Solids or 3D Shapes
  • Quadratic Functions
  • Parallelogram
  • Means
  • Parametric Curves

GeoGebra

  • About
  • Partners
  • GeoGebra on Tests
  • News Feed
  • App Downloads

Apps

  • Calculator Suite
  • Graphing Calculator
  • 3D Calculator
  • CAS Calculator
  • Scientific Calculator

Resources

  • Classroom Resources
  • Learn GeoGebra
  • Classroom
  • Geometry
  • Notes
  • Terms of Service Privacy License
  • Facebook Twitter YouTube