Graph Theory: 31. Lemma on Hamiltonian Graphs
37 بار بازدید -
6 سال پیش
-
I explain a proof of
I explain a proof of the following lemma: If a graph G is Hamiltonian, then for every nonempty subset S of the vertices, the number of connected components of the graph G-S is at most the size of S.
An introduction to Graph Theory by Dr. Sarada Herke.
6 سال پیش
در تاریخ 1397/12/16 منتشر شده
است.
37
بـار بازدید شده