Moving from Eulerian Graphs to the Route Inspection (Chinese Postman) Problem O1
In this resource, from the Department fof Education Standards Unit, students learn to distinguish, by drawing and by using the order of the vertices, between Eulerian graphs, semi-Eulerian graphs and graphs that are neither; and to find strategies for solving the route inspection or ‘Chinese postman’ problem. Students should have some knowledge of what is meant by a graph, a vertex and an edge in the context of decision mathematics. (AS/A level)
HEALTH and SAFETY
Any use of a resource that includes a practical activity must include a risk assessment. Please note that collections may contain ARCHIVE resources, which were developed at a much earlier date. Since that time there have been significant changes in the rules and guidance affecting laboratory practical work. Further information is provided in our Health and Safety guidance.