Q1: a)Why G representing Knigberg Bridges is not Eularian?

b)Is it possible to draw in a continuous way the following figures (without taking the pen off) by passing once through each line? c)Why? Solution: a) In graph theory, an Eulerian trail is a trail in a graph which visits each edge exactly once. Similarly, an Eulerian circuit is an Eulerian trail which starts and ends on the same vertex. Euler shows that the existence of a walk in a graph which traverses each edge once depends on the degrees of the nodes. The degree of a node is the number of edges touching it. Euler's argument shows that a necessary condition for the walk of the desired form to exist is that the graph be connected and have exactly zero or two nodes of odd degree. This condition turns out also to be sufficient -- a result stated by Euler and later proven by Carl Hierholzer. Such a walk is now called an Eulerian path or Euler walk in his honor. Further, if there are nodes of odd degree, all Eulerian paths start at one of them and end at the other. Since the graph corresponding to historical Knigsberg has four nodes of odd degree, it cannot have an Eulerian path b) The second one;) c) For the existence of Eulerian trails it is necessary that no more than two vertices have an odd degree Q2: Give the Gale-Shapley Alger to find a stable matching. Solution: Dd All three are stable because instability requires both participants to be happier with an alternative match. Q3: How map coloring can be modeled as a graph coloring problem? Given any map, describe a graph.

Solution: We need the number of colours equals to the number of neighbors that the country which has the most neighbor in the relevant map.