understand the meaning of the terms Eulerian graph, Eulerian trail, semi-Eulerian graph, semi-Eulerian trail and the conditions for their existence, and use these concepts to investigate and solve practical problems, e.g. the Königsberg bridge problem, planning a garbage bin collection route
4.2.2.6
understand the meaning of the terms Hamiltonian graph and semi-Hamiltonian graph and use these concepts to investigate and solve practical problems (by trial-and-error methods only), e.g. planning a sightseeing tourist route around a city, the travelling-salesman problem
