推 michael7201: 大概是 Hamiltonian path 09/23 00:51
→ michael7201: 不對 要 cycle XD 09/23 00:52
→ arthurduh1: 先砍掉 12 和 6,目標變成從 {5, 7} 到 {1, 11} 找 09/23 10:44
→ arthurduh1: 兩條 disjoint 的 paths 09/23 10:44
→ arthurduh1: 再砍 1, 5, 7, 11 發現就只剩兩條可能的 09/23 10:46
→ arthurduh1: [2, 9, 4] 和 [8, 3, 10] 09/23 10:46
推 arthurduh1: 咦,是四組XD 09/23 10:48
→ arthurduh1: 2, 4, 8, 10 都能各自接 1, 5, 7, 11 09/23 10:50
→ arthurduh1: 除了四個 [i, i+1] 的以外 09/23 10:54
→ arthurduh1: 還有 [5, 10] 09/23 11:00