Ask your own question, for FREE!
Mathematics 18 Online
OpenStudy (juana02):

Imagine a very large connected graph that has two odd vertices and 398 even vertices. a) Does a Euler path exist for this graph? Explain. b) Does an Euler circuit exist for this graph? Explain.

OpenStudy (bohotness):

what do you think the answer is?

OpenStudy (anonymous):

I think Its B

OpenStudy (juana02):

@MARC_

OpenStudy (juana02):

Why do I think it's b can u explain?

OpenStudy (juana02):

@maddymayhbunny

OpenStudy (juana02):

i am not sure i need someone to explain to me how to solve this problem?

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!