ملخص
We prove that, for sufficiently large n, the first player can win the strong perfect matching and Hamilton cycle games. For both games, explicit winning strategies of the first player are given. In devising these strategies we make use of the fact that explicit fast winning strategies are known for the corresponding weak games.
| اللغة الأصلية | الإنجليزيّة |
|---|---|
| دورية | Electronic Journal of Combinatorics |
| مستوى الصوت | 18 |
| رقم الإصدار | 1 |
| المعرِّفات الرقمية للأشياء | |
| حالة النشر | نُشِر - 2011 |
| منشور خارجيًا | نعم |