Graph Theory: 29. Lovasz Conjecture on Hamilton Paths
65 بار بازدید -
6 سال پیش
-
Lovasz has conjectured that every
Lovasz has conjectured that every finite connected vertex-transitive graph has a Hamilton path. In this video I explain what vertex-transitive graphs are and provide some examples and non-examples. I begin by defining an automorphism of a graph and similar vertices.
6 سال پیش
در تاریخ 1397/12/16 منتشر شده
است.
65
بـار بازدید شده