Traversability in Graphs (UMAP)

This module provides an elemntary introduction to Eulerian and Hamiltonian graphs by modeling the Chinese Postman Problem and the Travelling Salesman Problem. The authors present existence theorems, constructive algorithms, and numerous examples. Students learn about Eulerian and Hamiltonian graphs and the use of graph theory as a modeling technique.

Table of Contents:

1. INTRODUCTION

2. SOME EXAMPLES

3. MODELING WITH GRAPHS

4. EULERIAN GRAPHS

5. HAMILTONIAN GRAPHS

6. GENERALIZATION

7. REFERENCES

8. ANSWERS TO THE EXERCISES