ha? is the simplified version of Euler circle?
所在版块：求学狮城 发贴时间：2003-05-30 17:23

用户信息
复制本帖HTML代码
高亮: 今天贴 X 昨天贴 X 前天贴 X 
if you want to have any EUla circle,
then every points must have Even path linking out
if you want just go through , no need to come back
then can have one point with odd number of paths linking out...
.
欢迎来到华新中文网，踊跃发帖是支持我们的最好方法!

Ever Thine, Ever Mine, Ever Ours
　相关帖子 我要回复↙ ↗回到正文
一道思索数年的小学题目 － 冷色蓝天 　2003-05-30 15:05 (724 bytes , 1011reads )
Newton knows the answer － 顽哆拉 　2003-06-05 15:20 (0 bytes , 144reads )
答案就在下面的帖子里 － 冷色蓝天 　2003-06-09 14:10 (0 bytes , 177reads )
看来是公布答案的时候了 － 冷色蓝天 　2003-06-01 02:53 (264 bytes , 274reads )
还是哪位高人提出个答案统一一下吧 － 陀螺 　2003-05-31 03:42 (123 bytes , 323reads )
嗬嗬，知道了，原来好简单！！！ － 汪！ 　2003-05-31 09:38 (0 bytes , 183reads )
dun have, becoz got points with odd linking － MrDJay 　2003-05-30 17:24 (0 bytes , 199reads )
wrong... － 冷色蓝天 　2003-05-30 18:08 (71 bytes , 214reads )
well, can group it and use peogeon hole to － MrDJay 　2003-05-30 20:03 (94 bytes , 255reads )
not sure about your solution, pls enlighten me － 陀螺 　2003-05-30 16:44 (40 bytes , 343reads )
如果不知道这个概念 － 冷色蓝天 　2003-05-30 18:08 (14 bytes , 190reads )
ha? is the simplified version of Euler circle? － MrDJay 　2003-05-30 17:23 (203 bytes , 282reads )
wrong... － 冷色蓝天 　2003-05-30 18:12 (131 bytes , 209reads )
ft － 汪！ 　2003-05-30 23:19 (66 bytes , 259reads )
我想 － 鬼 　2003-05-30 23:44 (160 bytes , 224reads )
ft,我的第一万贴阿！！不小心用错id了 － 汪！ 　2003-05-30 23:45 (75 bytes , 205reads )
汪！汪！ － 乖乖龙 　2003-05-31 12:33 (0 bytes , 156reads )
well, you are right..:^P, mixing with Euler and He － MrDJay 　2003-05-30 19:48 (17 bytes , 218reads )
some of your statement is wrong － fool 　2003-05-30 17:50 (494 bytes , 242reads )
sorry, should be EXACTLY 2 odd vertex if it has － MrDJay 　2003-05-30 19:46 (20 bytes , 201reads )
wrong again, － fool 　2003-06-07 11:00 (94 bytes , 180reads )