作者mqazz1 (无法显示)
看板Math
标题[图论] Hamiltonian的证明
时间Fri Jan 28 21:07:34 2011
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
1F：推 hcsoso :这就是上次说的 Grinberg 定理. 用 Euler formula! 01/28 21:34