Graph Theory, Necessary and sufficient condition digraphs to be Eulerian.
Page 90, Theorem 4.6 ( To show that a digraph is hamiltonian if and only if for each vertex v, indegree (v) =outdegree (v) Page 92 Exercise problem 4.1 ( A modified version of konigsberg problem where, two extra bridges are built. ) Page 93, Figure 4.5 need to show as Hamilton. (Show that dodecahedron is hami