How to find an Eulerian circuit in a complicated Graph 
Consider the following graph G:



(a) Give a decomposition of G into cycles.
(b) Find an Eulerian circuit in G.

This is a very complicated graph and each time I am trying to find the solution I am getting lost in the middle. Is there any technique to solve such a problem?
Its really very difficult to find the Eulerian path.
Can anyone please help me?
Thanks in advance.

There are 8 vertices inside and 8 outside. Draw the 8 point star at the center first. Then go out and complete the octagon edges. Then zigzag in and out to finish the remaining edges.
