Chapter VI - The Case of the Runaway Mouse

Manori succeeds in finding the runaway mouse in Chapter VI by using a very simply property of graph theory, which teachers generally assign as an exercise within the first hour or two of class. When you move from vertex A to vertex B, following the edges in a graph, it isn't hard to see that you reach a given vertex (other than A and B) as many times as you leave it, which means that when drawing such a path, each vertex other than the departure and arrival points is of an even degree (that is, the number of edges that touch it is even).

Teaching notes - Eulerian and Hamiltonian Cycles

 

• Home
• Chapter I
  Respecting the Rules
• Chapter II
  The Villas of the Bellevue
• Chapter III
  The Case of the Missing Files
• Chapter IV
  The Case of the Hidden Inheritance
• Chapter V
  An Unhappy Employee
• Chapter VI
  The Case of the Runaway Mouse
• Chapter VII
  The Case of the Hooded Man
• Chapter VIII
  The Getaway Car
• Chapter IX
  The Sudoku Apprentice
• Bibliography

Home :: Chapter I Respecting the Rules :: Chapter II The Villas of the Bellevue :: Chapter III The Case of the Missing Files :: Chapter IV The Case of the Hidden Inheritance :: Chapter V An Unhappy Employee :: Chapter VI The Case of the Runaway Mouse :: Chapter VII The Case of the Hooded Man :: Chapter VIII The Getaway Car :: Chapter IX The Sudoku Apprentice :: Bibliography