Discussion:
Q: Let G be a graph. The line graph L(G) of G is defined to be the graph whose vertices are the edges of G and where two vertices of L(G) are adjacent if the corresponding edges of G are adjacent. Prove that if G is connected, then L(G) is eulerian if vertices of G are all odd or all even.