An undirected graph possesses an eulerian circuit if and only if it is connected and its vertices are 

• A. all of even degree
• B. all of odd degree
• C. of any degree
• D. even in number