[圖論] Hamiltonian的證明

看板Math作者mqazz1 (無法顯示)時間15年前 (2011/01/28 21:07)推噓1(1推 0噓 0→)

留言1則, 1人參與討論串1/2 (看更多)

Let G be a planar Hamiltonian simple graph with n vertices Let C be a Hamiltonian cycle in G Then with respect to C, prove Σ(k-2)(rk-sk) = 0 Here rk is the number of faces inside C whose boundary contain exactly k edges sk is the number of faces outside C whose boundary contains exactly k edges 原始: http://ppt.cc/(6W, 請問這題要怎麼證呢? 謝謝 -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 61.228.27.164

推

hcsoso

01/28 21:34, , 1^F

01/28 21:34, 1^F

‣ 返回看板[ Math ] 數學

‣ 更多 mqazz1 的文章

文章代碼(AID): #1DGh-P7l (Math)