Unit II
Definition of Euler graph -
Theorem. G is an Euler graph if and only if all its vertices are of even degree
Definition of Unicursal graph
Theorem In a connected graph of 2k vertices there exists k edge disjoint subgraph such that they together contains all the edges of G and each is a Unicursal graph.
Page 20,21,22
