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.
Follow Math Help Forum on Facebook and Google+
View Tag Cloud