Unicursal and Multicursal Graphs

A

aeh49

New member
Joined
May 5, 2009
Messages
10
Prove Euler's theorem that a graph with more than 2 odd nodes is multicursal.

Next, prove Listing's corollary to Euler's fourth theorem: A graph with exactly 2n odd nodes can be traversed completely in n separate routes.

Thanks for any help with these 2 questions!
 
aeh49 said:
Prove Euler's theorem that a graph with more than 2 odd nodes is multicursal.

Next, prove Listing's corollary to Euler's fourth theorem: A graph with exactly 2n odd nodes can be traversed completely in n separate routes.

Thanks for any help with these 2 questions!
Click to expand...

Do a google search - you'll find many sites with complete proof!!! You can simply copy and paste - no other work, no understanding involved!!!
 
You must not be doing a very good job. Most of the sites do not have proof - but some of those do. I personally went to the sites and read those.....

Now it is your turn...
 
You must log in or register to reply here.
Top