Math Club – November

As we have seen that any city map can be converted into a graph, the problem of traveling on bridges can be thought as being able to draw the graph with 2 conditions:

1. You should not lift the pen while drawing.
2. Each edge (or line) should be drawn only once. So, you can’t go over any edge again.

Do you have any ideas about which graphs are possible or not possible to draw? Do you observe any patterns?