Share
Explore BrainMass

Double Eulerian tour

Use words to describe the solution process. No programming.

4. Suppose G is a graph. We define a double Eulerian tour as a walk that crosses each edge of G twice in different directions and that starts and ends at the same vertex. Show that every connected graph has a double Eulerian tour.

Attachments

Solution Summary

This is a proof regarding connected graphs and double Eulerian tours.

$2.19