Let $G$ be a graph such that all vertices of $G$ have odd degree. Let $e$ be any edge of $G$.
Posted: Jun 12 '12
Seen: 41 times
Last updated: Oct 20 '12
The cube of a connected graph is hamiltonian
Minimum edge cover vs Maximum matching
Perfect Matchings in Cubic Graphs
Edge connectivity vs Strong connectivity