Telecharger Cours

Graph Theory

A connected graph on n ? 1 vertices and n ? 1 edges is a tree. Proof. HW. Lemma 11. The vertices of every connected graph on n ? 2 vertices can be ordered. ( ...



Download