Across
- 2. planar, connected and acyclic network
- 5. when all the degrees are ... there is a eulerian path
- 8. graph
- 10. Number of edges that meet at a given vertex
- 11. a set of lines and points
- 12. ...vertices are connected to each other
- 14. closed path
- 15. A line between two vertices
- 17. vertex
Down
- 1. A Swiss mathematician who proved important theorems about graphs
- 3. a ... path uses each edge of the network once and once only.
- 4. a .. graph has a path between each pair of vertices
- 6. plural of vertex
- 7. the value of the sum V+F-E on any given planar graph
- 9. network
- 13. node
- 16. a ... graph has an edge between each pair of vertices