Let be a simple graph in which the degree of every vertex is at least 2. Prove that has a vertex, such that every edge drawn from that vertex belongs to a circuit.

Printable View

- Feb 19th 2008, 09:14 AMjames_bondGraph
Let be a simple graph in which the degree of every vertex is at least 2. Prove that has a vertex, such that every edge drawn from that vertex belongs to a circuit.