Let G be a connected non-Eulerican graph. Prove that the minimum number of trails that together transverse each edge of G exactly once is half the number of vertices having odd degree.

ty.

Printable View

- May 7th 2007, 10:20 AMherograph theory
Let G be a connected non-Eulerican graph. Prove that the minimum number of trails that together transverse each edge of G exactly once is half the number of vertices having odd degree.

ty.