GeoGebra
GeoGebra
  • Searching for Eulerian and Hamiltonian Paths

Searching for Eulerian and Hamiltonian Paths

Author:
Rose Neal, vinylmath
Study each of the 6 graphs provided. (a) For each graph, find a Eulerian Path if one exists (i.e., a path for which each edge can be traversed exactly one time). (b) Next, find a Hamiltonian Path if one exists (i.e., a path that visits each vertex exactly once). (c) What do you notice about Graphs 4 and 5? (d) What do you notice about Graphs 3 and 6?

  • Graph 1

  • Graph 2

  • Graph 3

  • Graph 4

  • Graph 5

  • Graph 6

Next
Graph 1

New Resources

  • Monty Hall Problem
  • G_8.04 Solving right triangles
  • Fubini's theorem: Rectangular regions
  • Action/Consequence: Proving Parallelograms
  • G_11.01 Radians, arc length and sector area

Discover Resources

  • Angle Trisection Method by Archimedes
  • Paralelogram_u_trokut
  • Multiplication on the Argand Diagram
  • altitude concurrency
  • Modul 9A_Rr. KUNTIE_SMPN 1 LASEL

Discover Topics

  • Polynomial Functions
  • Difference and Slope
  • Algebra
  • Unit Circle
  • Interest Calculation

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