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

Printable View

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