I must find out for what values of n and m the complete bipartite graph K(n,m) is eulerian.Can you give me some sugestions or hints to where to start ?I know the definitions but I don't know where to begin to solve this problem.
Hint: A connected graph is Eulerian if and only if every vertex has what property?
Sign up using Google
Sign up using Facebook
Sign up using Stack Exchange
By posting your answer, you agree to the
terms of service.
3 months ago
2 months ago