Prove or disprove: If a graph has exactly two vertices of odd degree, then there is a path connecting those vertices.

Printable View

- March 25th 2010, 09:14 AMMath101Prove or disprove about graphs
Prove or disprove: If a graph has exactly two vertices of odd degree, then there is a path connecting those vertices.

- March 25th 2010, 09:49 AMPlato