FIND THE ANSWERS

Prove that if a connected graph has a 2k vertices of odd degree, then there are k disjoint trails that contain all the edges.?

Answer this question

Do you know the correct answer? Make money answering questions! Join now.
  • Prove that if a connected graph has a 2k vertices of odd degree, then there are k disjoint trails that contain all the edges.?


Answers