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.
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.
Here's how it works:
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top