Chinese Postman Problem

Edit Answers
12345678910
Across
  1. 4. that can be drawn without taking a pen from the paper and without retracing the same edge.
  2. 6. a graph has 2 vertices, then the graph is said to be ______.
  3. 7. man behind or formulated this problem.
  4. 8. _____ Problem.
  5. 10. a graph to be eulerian, all vertices must be of ___ order.
Down
  1. 1. 1: List all ___ vertices.
  2. 2. name for this chinese postman problem.
  3. 3. man who gave an alternative name for the problem.
  4. 5. wishes to travel along every road in order to deliver letters at ____ possible distance.
  5. 9. place where the man behind this chinese postman problem was born.